/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 10:54:21,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 10:54:21,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 10:54:21,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 10:54:21,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 10:54:21,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 10:54:21,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 10:54:21,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 10:54:21,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 10:54:21,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 10:54:21,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 10:54:21,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 10:54:21,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 10:54:21,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 10:54:21,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 10:54:21,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 10:54:21,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 10:54:21,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 10:54:21,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 10:54:21,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 10:54:21,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 10:54:21,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 10:54:21,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 10:54:21,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 10:54:21,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 10:54:21,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 10:54:21,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 10:54:21,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 10:54:21,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 10:54:21,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 10:54:21,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 10:54:21,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 10:54:21,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 10:54:21,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 10:54:22,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 10:54:22,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 10:54:22,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 10:54:22,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 10:54:22,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 10:54:22,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 10:54:22,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 10:54:22,004 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 10:54:22,018 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 10:54:22,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 10:54:22,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 10:54:22,020 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 10:54:22,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 10:54:22,020 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:54:22,020 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 10:54:22,020 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 10:54:22,020 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 10:54:22,021 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 10:54:22,021 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 10:54:22,021 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 10:54:22,021 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 10:54:22,021 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 10:54:22,021 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:54:22,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 10:54:22,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 10:54:22,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 10:54:22,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 10:54:22,022 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 10:54:22,023 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 10:54:22,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 10:54:22,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 10:54:22,023 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 10:54:22,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:54:22,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 10:54:22,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 10:54:22,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 10:54:22,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 10:54:22,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 10:54:22,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 10:54:22,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 10:54:22,212 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 10:54:22,213 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 10:54:22,214 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 10:54:22,277 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_H3Bt3y/tmp/10a254e41fc24c50bff850929fc0e91a/FLAG1c477d205 [2020-07-01 10:54:22,607 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 10:54:22,608 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 10:54:22,614 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_H3Bt3y/tmp/10a254e41fc24c50bff850929fc0e91a/FLAG1c477d205 [2020-07-01 10:54:23,010 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_H3Bt3y/tmp/10a254e41fc24c50bff850929fc0e91a [2020-07-01 10:54:23,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 10:54:23,022 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 10:54:23,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 10:54:23,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 10:54:23,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 10:54:23,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74004b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23, skipping insertion in model container [2020-07-01 10:54:23,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 10:54:23,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 10:54:23,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:54:23,293 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 10:54:23,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:54:23,334 INFO L208 MainTranslator]: Completed translation [2020-07-01 10:54:23,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23 WrapperNode [2020-07-01 10:54:23,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 10:54:23,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 10:54:23,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 10:54:23,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 10:54:23,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 10:54:23,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 10:54:23,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 10:54:23,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 10:54:23,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 10:54:23,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 10:54:23,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 10:54:23,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 10:54:23,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:54:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 10:54:23,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 10:54:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 10:54:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 10:54:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 10:54:23,722 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 10:54:23,722 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 10:54:23,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:54:23 BoogieIcfgContainer [2020-07-01 10:54:23,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 10:54:23,726 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 10:54:23,727 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 10:54:23,728 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 10:54:23,729 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:54:23" (1/1) ... [2020-07-01 10:54:23,743 INFO L313 BlockEncoder]: Initial Icfg 28 locations, 34 edges [2020-07-01 10:54:23,744 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 10:54:23,745 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 10:54:23,745 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 10:54:23,746 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:54:23,748 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 10:54:23,749 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 10:54:23,749 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 10:54:23,772 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 10:54:23,803 INFO L200 BlockEncoder]: SBE split 13 edges [2020-07-01 10:54:23,807 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-07-01 10:54:23,809 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:54:23,822 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 10:54:23,824 INFO L70 RemoveSinkStates]: Removed 4 edges and 3 locations by removing sink states [2020-07-01 10:54:23,826 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:54:23,826 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:54:23,826 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 10:54:23,827 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:54:23,827 INFO L313 BlockEncoder]: Encoded RCFG 22 locations, 40 edges [2020-07-01 10:54:23,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:54:23 BasicIcfg [2020-07-01 10:54:23,828 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 10:54:23,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 10:54:23,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 10:54:23,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 10:54:23,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 10:54:23" (1/4) ... [2020-07-01 10:54:23,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134693e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:54:23, skipping insertion in model container [2020-07-01 10:54:23,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (2/4) ... [2020-07-01 10:54:23,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134693e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:54:23, skipping insertion in model container [2020-07-01 10:54:23,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:54:23" (3/4) ... [2020-07-01 10:54:23,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134693e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:54:23, skipping insertion in model container [2020-07-01 10:54:23,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:54:23" (4/4) ... [2020-07-01 10:54:23,836 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:54:23,846 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 10:54:23,853 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-01 10:54:23,867 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-01 10:54:23,890 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 10:54:23,890 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 10:54:23,890 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:54:23,890 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:54:23,890 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:54:23,891 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 10:54:23,891 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:54:23,891 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 10:54:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-01 10:54:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 10:54:23,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:23,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 10:54:23,913 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash 3688191, now seen corresponding path program 1 times [2020-07-01 10:54:23,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:23,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756413578] [2020-07-01 10:54:23,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:24,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756413578] [2020-07-01 10:54:24,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:24,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:54:24,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127624254] [2020-07-01 10:54:24,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:24,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:24,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,135 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-01 10:54:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:24,234 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2020-07-01 10:54:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:24,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 10:54:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:24,249 INFO L225 Difference]: With dead ends: 22 [2020-07-01 10:54:24,250 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 10:54:24,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 10:54:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 10:54:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 10:54:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2020-07-01 10:54:24,290 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 4 [2020-07-01 10:54:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:24,292 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. [2020-07-01 10:54:24,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. [2020-07-01 10:54:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 10:54:24,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:24,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 10:54:24,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 10:54:24,294 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 3688193, now seen corresponding path program 1 times [2020-07-01 10:54:24,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:24,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296625729] [2020-07-01 10:54:24,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:24,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296625729] [2020-07-01 10:54:24,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:24,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:54:24,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792273387] [2020-07-01 10:54:24,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:24,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:24,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,328 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 3 states. [2020-07-01 10:54:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:24,426 INFO L93 Difference]: Finished difference Result 39 states and 67 transitions. [2020-07-01 10:54:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:24,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 10:54:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:24,428 INFO L225 Difference]: With dead ends: 39 [2020-07-01 10:54:24,428 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 10:54:24,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 10:54:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2020-07-01 10:54:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 10:54:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2020-07-01 10:54:24,435 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 39 transitions. Word has length 4 [2020-07-01 10:54:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:24,435 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 39 transitions. [2020-07-01 10:54:24,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 39 transitions. [2020-07-01 10:54:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 10:54:24,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:24,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 10:54:24,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 10:54:24,437 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash 3688194, now seen corresponding path program 1 times [2020-07-01 10:54:24,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:24,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273782179] [2020-07-01 10:54:24,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:24,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273782179] [2020-07-01 10:54:24,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:24,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:54:24,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362233170] [2020-07-01 10:54:24,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:24,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:24,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,478 INFO L87 Difference]: Start difference. First operand 22 states and 39 transitions. Second operand 3 states. [2020-07-01 10:54:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:24,616 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. [2020-07-01 10:54:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:24,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 10:54:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:24,618 INFO L225 Difference]: With dead ends: 28 [2020-07-01 10:54:24,618 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 10:54:24,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 10:54:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-07-01 10:54:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 10:54:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2020-07-01 10:54:24,623 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 4 [2020-07-01 10:54:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:24,623 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 38 transitions. [2020-07-01 10:54:24,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 38 transitions. [2020-07-01 10:54:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 10:54:24,624 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:24,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 10:54:24,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 10:54:24,625 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:24,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash 114332685, now seen corresponding path program 1 times [2020-07-01 10:54:24,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:24,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783904887] [2020-07-01 10:54:24,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:24,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783904887] [2020-07-01 10:54:24,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:24,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:54:24,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497828935] [2020-07-01 10:54:24,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:24,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,658 INFO L87 Difference]: Start difference. First operand 22 states and 38 transitions. Second operand 3 states. [2020-07-01 10:54:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:24,742 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-07-01 10:54:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:24,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 10:54:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:24,743 INFO L225 Difference]: With dead ends: 28 [2020-07-01 10:54:24,743 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 10:54:24,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 10:54:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-07-01 10:54:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 10:54:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2020-07-01 10:54:24,748 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 5 [2020-07-01 10:54:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:24,748 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 42 transitions. [2020-07-01 10:54:24,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 42 transitions. [2020-07-01 10:54:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 10:54:24,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:24,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 10:54:24,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 10:54:24,750 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:24,750 INFO L82 PathProgramCache]: Analyzing trace with hash 114332682, now seen corresponding path program 1 times [2020-07-01 10:54:24,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:24,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524548568] [2020-07-01 10:54:24,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:24,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524548568] [2020-07-01 10:54:24,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:24,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:54:24,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607560841] [2020-07-01 10:54:24,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:24,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,777 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand 3 states. [2020-07-01 10:54:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:24,833 INFO L93 Difference]: Finished difference Result 23 states and 42 transitions. [2020-07-01 10:54:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:24,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 10:54:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:24,834 INFO L225 Difference]: With dead ends: 23 [2020-07-01 10:54:24,835 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 10:54:24,835 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 10:54:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 10:54:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 10:54:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-07-01 10:54:24,839 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 5 [2020-07-01 10:54:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:24,839 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-07-01 10:54:24,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-07-01 10:54:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 10:54:24,840 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:24,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 10:54:24,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 10:54:24,841 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:24,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:24,841 INFO L82 PathProgramCache]: Analyzing trace with hash 114332684, now seen corresponding path program 1 times [2020-07-01 10:54:24,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:24,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152994739] [2020-07-01 10:54:24,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:24,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152994739] [2020-07-01 10:54:24,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:24,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:54:24,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089608015] [2020-07-01 10:54:24,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:24,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:24,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:24,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,889 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. [2020-07-01 10:54:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:24,990 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2020-07-01 10:54:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:24,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 10:54:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:24,991 INFO L225 Difference]: With dead ends: 24 [2020-07-01 10:54:24,991 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 10:54:24,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 10:54:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-01 10:54:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 10:54:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2020-07-01 10:54:24,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 35 transitions. Word has length 5 [2020-07-01 10:54:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:24,996 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 35 transitions. [2020-07-01 10:54:24,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 35 transitions. [2020-07-01 10:54:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 10:54:24,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:24,997 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:24,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 10:54:24,997 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:24,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1113756494, now seen corresponding path program 1 times [2020-07-01 10:54:24,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:24,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25065267] [2020-07-01 10:54:24,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:25,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25065267] [2020-07-01 10:54:25,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824370223] [2020-07-01 10:54:25,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:25,095 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:25,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:25,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:25,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-07-01 10:54:25,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425909297] [2020-07-01 10:54:25,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:25,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:25,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:25,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:25,152 INFO L87 Difference]: Start difference. First operand 21 states and 35 transitions. Second operand 4 states. [2020-07-01 10:54:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:25,212 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. [2020-07-01 10:54:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:25,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-01 10:54:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:25,213 INFO L225 Difference]: With dead ends: 24 [2020-07-01 10:54:25,213 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 10:54:25,214 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 10:54:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-01 10:54:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 10:54:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2020-07-01 10:54:25,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 9 [2020-07-01 10:54:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:25,218 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. [2020-07-01 10:54:25,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-07-01 10:54:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 10:54:25,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:25,219 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:25,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-01 10:54:25,420 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1113756495, now seen corresponding path program 1 times [2020-07-01 10:54:25,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:25,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11201010] [2020-07-01 10:54:25,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:25,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11201010] [2020-07-01 10:54:25,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621962306] [2020-07-01 10:54:25,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:25,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 10:54:25,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:25,566 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 10:54:25,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 10:54:25,567 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 10:54:25,575 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 10:54:25,576 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 10:54:25,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2020-07-01 10:54:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:25,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 10:54:25,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-01 10:54:25,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355258270] [2020-07-01 10:54:25,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 10:54:25,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:25,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 10:54:25,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:25,620 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 6 states. [2020-07-01 10:54:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:25,739 INFO L93 Difference]: Finished difference Result 39 states and 64 transitions. [2020-07-01 10:54:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:25,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-01 10:54:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:25,741 INFO L225 Difference]: With dead ends: 39 [2020-07-01 10:54:25,741 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 10:54:25,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 10:54:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-07-01 10:54:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 10:54:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2020-07-01 10:54:25,746 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 9 [2020-07-01 10:54:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:25,746 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2020-07-01 10:54:25,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 10:54:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2020-07-01 10:54:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 10:54:25,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:25,747 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:25,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:25,948 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash 166711648, now seen corresponding path program 1 times [2020-07-01 10:54:25,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:25,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774730130] [2020-07-01 10:54:25,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:26,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774730130] [2020-07-01 10:54:26,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486966400] [2020-07-01 10:54:26,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:26,044 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:26,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:26,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:26,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-07-01 10:54:26,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046666251] [2020-07-01 10:54:26,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:26,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:26,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-01 10:54:26,090 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2020-07-01 10:54:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:26,164 INFO L93 Difference]: Finished difference Result 26 states and 40 transitions. [2020-07-01 10:54:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:26,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 10:54:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:26,166 INFO L225 Difference]: With dead ends: 26 [2020-07-01 10:54:26,166 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 10:54:26,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-01 10:54:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 10:54:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 10:54:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 10:54:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2020-07-01 10:54:26,170 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 10 [2020-07-01 10:54:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:26,170 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. [2020-07-01 10:54:26,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. [2020-07-01 10:54:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 10:54:26,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:26,171 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:26,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:26,372 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash 166711647, now seen corresponding path program 1 times [2020-07-01 10:54:26,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:26,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654229678] [2020-07-01 10:54:26,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 10:54:26,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654229678] [2020-07-01 10:54:26,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:26,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 10:54:26,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33146773] [2020-07-01 10:54:26,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:26,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:26,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:26,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 10:54:26,425 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 4 states. [2020-07-01 10:54:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:26,485 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2020-07-01 10:54:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:26,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 10:54:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:26,486 INFO L225 Difference]: With dead ends: 25 [2020-07-01 10:54:26,486 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 10:54:26,486 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 10:54:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 10:54:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 10:54:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 10:54:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2020-07-01 10:54:26,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 38 transitions. Word has length 10 [2020-07-01 10:54:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:26,490 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-07-01 10:54:26,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. [2020-07-01 10:54:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 10:54:26,491 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:26,491 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1] [2020-07-01 10:54:26,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 10:54:26,492 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash -30609630, now seen corresponding path program 2 times [2020-07-01 10:54:26,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:26,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047446067] [2020-07-01 10:54:26,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:26,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047446067] [2020-07-01 10:54:26,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473135175] [2020-07-01 10:54:26,556 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:26,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 10:54:26,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 10:54:26,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:26,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:26,601 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 10:54:26,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 10:54:26,601 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 10:54:26,608 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 10:54:26,609 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 10:54:26,609 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2020-07-01 10:54:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 10:54:26,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:26,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-07-01 10:54:26,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473941322] [2020-07-01 10:54:26,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:26,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 10:54:26,646 INFO L87 Difference]: Start difference. First operand 24 states and 38 transitions. Second operand 4 states. [2020-07-01 10:54:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:26,709 INFO L93 Difference]: Finished difference Result 24 states and 38 transitions. [2020-07-01 10:54:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:26,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-01 10:54:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:26,710 INFO L225 Difference]: With dead ends: 24 [2020-07-01 10:54:26,710 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 10:54:26,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 10:54:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 10:54:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-01 10:54:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 10:54:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2020-07-01 10:54:26,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 14 [2020-07-01 10:54:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:26,715 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-07-01 10:54:26,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 36 transitions. [2020-07-01 10:54:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 10:54:26,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:26,715 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:26,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:26,916 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash 649391507, now seen corresponding path program 1 times [2020-07-01 10:54:26,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:26,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101216924] [2020-07-01 10:54:26,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:26,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101216924] [2020-07-01 10:54:26,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596821267] [2020-07-01 10:54:26,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:26,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:54:26,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 10:54:26,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:26,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 10:54:26,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998346631] [2020-07-01 10:54:26,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:26,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:26,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:26,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:26,995 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. Second operand 3 states. [2020-07-01 10:54:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:27,036 INFO L93 Difference]: Finished difference Result 46 states and 74 transitions. [2020-07-01 10:54:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:27,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-01 10:54:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:27,037 INFO L225 Difference]: With dead ends: 46 [2020-07-01 10:54:27,037 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 10:54:27,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 10:54:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2020-07-01 10:54:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 10:54:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2020-07-01 10:54:27,042 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 16 [2020-07-01 10:54:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:27,042 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2020-07-01 10:54:27,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2020-07-01 10:54:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 10:54:27,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:27,043 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:27,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-01 10:54:27,244 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:27,244 INFO L82 PathProgramCache]: Analyzing trace with hash 649392468, now seen corresponding path program 1 times [2020-07-01 10:54:27,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:27,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194388691] [2020-07-01 10:54:27,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:27,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194388691] [2020-07-01 10:54:27,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030097820] [2020-07-01 10:54:27,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:27,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:54:27,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 10:54:27,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:27,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 10:54:27,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299717204] [2020-07-01 10:54:27,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:54:27,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:27,324 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 3 states. [2020-07-01 10:54:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:27,354 INFO L93 Difference]: Finished difference Result 38 states and 60 transitions. [2020-07-01 10:54:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:27,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-01 10:54:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:27,355 INFO L225 Difference]: With dead ends: 38 [2020-07-01 10:54:27,355 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 10:54:27,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 10:54:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 10:54:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 10:54:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-07-01 10:54:27,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 16 [2020-07-01 10:54:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:27,359 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-07-01 10:54:27,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:54:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2020-07-01 10:54:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 10:54:27,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:27,360 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:27,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:27,561 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash -625458413, now seen corresponding path program 1 times [2020-07-01 10:54:27,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:27,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943613325] [2020-07-01 10:54:27,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:27,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943613325] [2020-07-01 10:54:27,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104534597] [2020-07-01 10:54:27,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:27,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:27,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:27,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 10:54:27,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-01 10:54:27,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901600232] [2020-07-01 10:54:27,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 10:54:27,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:27,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 10:54:27,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:27,644 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 6 states. [2020-07-01 10:54:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:27,709 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2020-07-01 10:54:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 10:54:27,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-01 10:54:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:27,710 INFO L225 Difference]: With dead ends: 40 [2020-07-01 10:54:27,710 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 10:54:27,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-01 10:54:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 10:54:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-01 10:54:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 10:54:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-01 10:54:27,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 16 [2020-07-01 10:54:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:27,714 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-01 10:54:27,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 10:54:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-01 10:54:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 10:54:27,715 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:27,715 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:27,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 10:54:27,916 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash -217480292, now seen corresponding path program 2 times [2020-07-01 10:54:27,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:27,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179643470] [2020-07-01 10:54:27,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:27,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179643470] [2020-07-01 10:54:27,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581808119] [2020-07-01 10:54:27,959 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:27,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 10:54:27,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 10:54:27,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 10:54:27,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-01 10:54:28,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:28,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2020-07-01 10:54:28,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822178569] [2020-07-01 10:54:28,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:28,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:28,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:28,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 10:54:28,003 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 4 states. [2020-07-01 10:54:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:28,038 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-01 10:54:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:28,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-01 10:54:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:28,039 INFO L225 Difference]: With dead ends: 28 [2020-07-01 10:54:28,039 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 10:54:28,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 10:54:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 10:54:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 10:54:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 10:54:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-07-01 10:54:28,043 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 21 [2020-07-01 10:54:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:28,044 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-01 10:54:28,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-01 10:54:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 10:54:28,044 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:28,044 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:28,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-01 10:54:28,245 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash -217480291, now seen corresponding path program 1 times [2020-07-01 10:54:28,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:28,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881259062] [2020-07-01 10:54:28,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:28,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881259062] [2020-07-01 10:54:28,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087036022] [2020-07-01 10:54:28,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:28,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 10:54:28,329 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:28,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 10:54:28,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-01 10:54:28,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948337684] [2020-07-01 10:54:28,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 10:54:28,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:28,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 10:54:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 10:54:28,341 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2020-07-01 10:54:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:28,411 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-07-01 10:54:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 10:54:28,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-01 10:54:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:28,412 INFO L225 Difference]: With dead ends: 45 [2020-07-01 10:54:28,412 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 10:54:28,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 10:54:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 10:54:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2020-07-01 10:54:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 10:54:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-07-01 10:54:28,417 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 21 [2020-07-01 10:54:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:28,418 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-07-01 10:54:28,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 10:54:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-01 10:54:28,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-01 10:54:28,419 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:28,419 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:28,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 10:54:28,620 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2058866508, now seen corresponding path program 2 times [2020-07-01 10:54:28,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:28,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397291946] [2020-07-01 10:54:28,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 10:54:28,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397291946] [2020-07-01 10:54:28,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771896187] [2020-07-01 10:54:28,680 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:28,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 10:54:28,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 10:54:28,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:28,707 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:28,731 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 10:54:28,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 10:54:28,732 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 10:54:28,741 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 10:54:28,742 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 10:54:28,743 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2020-07-01 10:54:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-01 10:54:28,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:28,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2020-07-01 10:54:28,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415960070] [2020-07-01 10:54:28,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:28,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:28,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:28,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-01 10:54:28,786 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2020-07-01 10:54:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:28,848 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-01 10:54:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:28,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-01 10:54:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:28,850 INFO L225 Difference]: With dead ends: 40 [2020-07-01 10:54:28,850 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 10:54:28,850 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-01 10:54:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 10:54:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2020-07-01 10:54:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 10:54:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2020-07-01 10:54:28,855 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 26 [2020-07-01 10:54:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:28,855 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-07-01 10:54:28,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-01 10:54:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-01 10:54:28,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:28,856 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:29,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 10:54:29,057 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 599645876, now seen corresponding path program 1 times [2020-07-01 10:54:29,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:29,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619569605] [2020-07-01 10:54:29,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-01 10:54:29,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619569605] [2020-07-01 10:54:29,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:29,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 10:54:29,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170660764] [2020-07-01 10:54:29,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:29,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:29,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 10:54:29,110 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 4 states. [2020-07-01 10:54:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:29,167 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-07-01 10:54:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:29,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-01 10:54:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:29,168 INFO L225 Difference]: With dead ends: 39 [2020-07-01 10:54:29,169 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 10:54:29,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 10:54:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 10:54:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2020-07-01 10:54:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 10:54:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2020-07-01 10:54:29,173 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 27 [2020-07-01 10:54:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:29,174 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2020-07-01 10:54:29,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-07-01 10:54:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-01 10:54:29,175 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:29,175 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:29,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 10:54:29,175 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1076272457, now seen corresponding path program 1 times [2020-07-01 10:54:29,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:29,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526773095] [2020-07-01 10:54:29,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 10:54:29,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526773095] [2020-07-01 10:54:29,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292553174] [2020-07-01 10:54:29,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:29,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 10:54:29,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 10:54:29,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 10:54:29,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-01 10:54:29,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733473380] [2020-07-01 10:54:29,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 10:54:29,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 10:54:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-01 10:54:29,293 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 8 states. [2020-07-01 10:54:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:29,362 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2020-07-01 10:54:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 10:54:29,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-01 10:54:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:29,363 INFO L225 Difference]: With dead ends: 56 [2020-07-01 10:54:29,363 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 10:54:29,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-01 10:54:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 10:54:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-01 10:54:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 10:54:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-01 10:54:29,369 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2020-07-01 10:54:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:29,369 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-01 10:54:29,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 10:54:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-01 10:54:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-01 10:54:29,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:29,370 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:29,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:29,571 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash 954182610, now seen corresponding path program 2 times [2020-07-01 10:54:29,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:29,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189033726] [2020-07-01 10:54:29,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 10:54:29,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189033726] [2020-07-01 10:54:29,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869142210] [2020-07-01 10:54:29,637 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:29,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 10:54:29,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 10:54:29,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:29,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:29,678 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 10:54:29,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 10:54:29,679 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 10:54:29,684 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 10:54:29,685 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 10:54:29,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2020-07-01 10:54:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-07-01 10:54:29,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:29,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2020-07-01 10:54:29,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026905316] [2020-07-01 10:54:29,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:29,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 10:54:29,718 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2020-07-01 10:54:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:29,752 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-01 10:54:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:29,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-01 10:54:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:29,753 INFO L225 Difference]: With dead ends: 40 [2020-07-01 10:54:29,753 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 10:54:29,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 10:54:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 10:54:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 10:54:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 10:54:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2020-07-01 10:54:29,758 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2020-07-01 10:54:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:29,758 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2020-07-01 10:54:29,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2020-07-01 10:54:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-01 10:54:29,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:29,759 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:29,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:29,960 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -485111978, now seen corresponding path program 1 times [2020-07-01 10:54:29,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:29,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960399529] [2020-07-01 10:54:29,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 10:54:30,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960399529] [2020-07-01 10:54:30,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953744347] [2020-07-01 10:54:30,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:30,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 10:54:30,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 10:54:30,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 10:54:30,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-01 10:54:30,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780692985] [2020-07-01 10:54:30,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 10:54:30,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:30,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 10:54:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-01 10:54:30,081 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 9 states. [2020-07-01 10:54:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:30,176 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2020-07-01 10:54:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 10:54:30,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-07-01 10:54:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:30,177 INFO L225 Difference]: With dead ends: 59 [2020-07-01 10:54:30,178 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 10:54:30,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-01 10:54:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 10:54:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-01 10:54:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 10:54:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2020-07-01 10:54:30,183 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 38 [2020-07-01 10:54:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:30,183 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2020-07-01 10:54:30,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 10:54:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-01 10:54:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-01 10:54:30,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:30,185 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:30,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-07-01 10:54:30,386 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:30,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1820194017, now seen corresponding path program 2 times [2020-07-01 10:54:30,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:30,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460267472] [2020-07-01 10:54:30,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 10:54:30,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460267472] [2020-07-01 10:54:30,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077485148] [2020-07-01 10:54:30,476 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:30,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 10:54:30,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 10:54:30,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:30,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:30,537 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 10:54:30,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 10:54:30,538 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 10:54:30,544 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 10:54:30,545 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 10:54:30,546 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2020-07-01 10:54:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-07-01 10:54:30,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 10:54:30,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2020-07-01 10:54:30,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293404025] [2020-07-01 10:54:30,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 10:54:30,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:30,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 10:54:30,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-07-01 10:54:30,586 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 4 states. [2020-07-01 10:54:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:30,621 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-07-01 10:54:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 10:54:30,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-07-01 10:54:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:30,622 INFO L225 Difference]: With dead ends: 45 [2020-07-01 10:54:30,622 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 10:54:30,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-07-01 10:54:30,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 10:54:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 10:54:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 10:54:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-01 10:54:30,627 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 43 [2020-07-01 10:54:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:30,627 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-01 10:54:30,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 10:54:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-01 10:54:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-01 10:54:30,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:30,628 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:30,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:30,829 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1820194016, now seen corresponding path program 1 times [2020-07-01 10:54:30,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:30,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163431769] [2020-07-01 10:54:30,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 10:54:30,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163431769] [2020-07-01 10:54:30,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884798668] [2020-07-01 10:54:30,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:30,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 10:54:30,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 10:54:30,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 10:54:30,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-01 10:54:30,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807182186] [2020-07-01 10:54:30,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 10:54:30,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:30,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 10:54:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-01 10:54:30,955 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 10 states. [2020-07-01 10:54:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:31,057 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-07-01 10:54:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 10:54:31,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-07-01 10:54:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:31,058 INFO L225 Difference]: With dead ends: 64 [2020-07-01 10:54:31,058 INFO L226 Difference]: Without dead ends: 53 [2020-07-01 10:54:31,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-01 10:54:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-01 10:54:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2020-07-01 10:54:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 10:54:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2020-07-01 10:54:31,062 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 43 [2020-07-01 10:54:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:31,063 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2020-07-01 10:54:31,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 10:54:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2020-07-01 10:54:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-01 10:54:31,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:54:31,064 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:54:31,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-07-01 10:54:31,264 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:54:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -230310665, now seen corresponding path program 2 times [2020-07-01 10:54:31,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:31,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131931556] [2020-07-01 10:54:31,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:31,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131931556] [2020-07-01 10:54:31,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627869610] [2020-07-01 10:54:31,423 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:31,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 10:54:31,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 10:54:31,449 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:54:31,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:54:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-07-01 10:54:31,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 10:54:31,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 3] total 14 [2020-07-01 10:54:31,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605049182] [2020-07-01 10:54:31,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 10:54:31,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 10:54:31,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-01 10:54:31,496 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 14 states. [2020-07-01 10:54:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:31,669 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-01 10:54:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 10:54:31,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-01 10:54:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:54:31,670 INFO L225 Difference]: With dead ends: 68 [2020-07-01 10:54:31,670 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 10:54:31,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-07-01 10:54:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 10:54:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 10:54:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 10:54:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 10:54:31,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-01 10:54:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:54:31,672 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 10:54:31,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 10:54:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 10:54:31,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 10:54:31,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 10:54:31,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 10:54:32,021 INFO L268 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2020-07-01 10:54:32,022 INFO L264 CegarLoopResult]: At program point L15-3(lines 15 17) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~i~0) (= 1 (select |#valid| |ULTIMATE.start_main_~#guess~0.base|)) (<= 0 |ULTIMATE.start_main_~#password~0.offset|) (<= 0 (* 4 ULTIMATE.start_main_~x~0)) (<= 0 ULTIMATE.start_main_~result~0) (<= |ULTIMATE.start_main_~#guess~0.offset| 0) (<= 0 |ULTIMATE.start_main_~#guess~0.offset|) (= 400000 (select |#length| |ULTIMATE.start_main_~#password~0.base|)) (<= |ULTIMATE.start_main_~#password~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_main_~#password~0.base|)) (= 400000 (select |#length| |ULTIMATE.start_main_~#guess~0.base|))) [2020-07-01 10:54:32,022 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 10:54:32,022 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 10:54:32,022 INFO L268 CegarLoopResult]: For program point L9-2(lines 9 11) no Hoare annotation was computed. [2020-07-01 10:54:32,022 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 10:54:32,022 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 10:54:32,022 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 10:54:32,022 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 10:54:32,023 INFO L268 CegarLoopResult]: For program point L8-2(lines 8 12) no Hoare annotation was computed. [2020-07-01 10:54:32,024 INFO L264 CegarLoopResult]: At program point L8-3(lines 8 12) the Hoare annotation is: (and (= 1 (select |#valid| |ULTIMATE.start_main_~#guess~0.base|)) (<= 0 ULTIMATE.start_main_~result~0) (<= |ULTIMATE.start_main_~#guess~0.offset| 0) (<= 0 |ULTIMATE.start_main_~#guess~0.offset|) (= 0 |ULTIMATE.start_main_~#password~0.offset|) (<= 0 ULTIMATE.start_main_~i~0) (= 400000 (select |#length| |ULTIMATE.start_main_~#password~0.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~#password~0.base|)) (= 400000 (select |#length| |ULTIMATE.start_main_~#guess~0.base|))) [2020-07-01 10:54:32,024 INFO L268 CegarLoopResult]: For program point L8-4(lines 3 20) no Hoare annotation was computed. [2020-07-01 10:54:32,024 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 10:54:32,024 INFO L268 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2020-07-01 10:54:32,027 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 10:54:32,035 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,036 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,043 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,044 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,045 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:54:32 BasicIcfg [2020-07-01 10:54:32,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 10:54:32,048 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 10:54:32,049 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 10:54:32,052 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 10:54:32,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:54:32,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 10:54:23" (1/5) ... [2020-07-01 10:54:32,053 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a60541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:54:32, skipping insertion in model container [2020-07-01 10:54:32,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:54:32,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:54:23" (2/5) ... [2020-07-01 10:54:32,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a60541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:54:32, skipping insertion in model container [2020-07-01 10:54:32,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:54:32,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:54:23" (3/5) ... [2020-07-01 10:54:32,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a60541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:54:32, skipping insertion in model container [2020-07-01 10:54:32,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:54:32,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:54:23" (4/5) ... [2020-07-01 10:54:32,055 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a60541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:54:32, skipping insertion in model container [2020-07-01 10:54:32,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:54:32,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:54:32" (5/5) ... [2020-07-01 10:54:32,056 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:54:32,080 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 10:54:32,080 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 10:54:32,080 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:54:32,080 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:54:32,081 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:54:32,081 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 10:54:32,081 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:54:32,081 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 10:54:32,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-01 10:54:32,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-01 10:54:32,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:54:32,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:54:32,093 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:54:32,093 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 10:54:32,093 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 10:54:32,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-01 10:54:32,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-01 10:54:32,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:54:32,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:54:32,094 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:54:32,094 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 10:54:32,099 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue [89] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 15#L-1true [118] L-1-->L8-3: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_~#password~0.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_~#password~0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#password~0.base_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_~#password~0.base_1|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_~#password~0.base_1| 400000) |v_ULTIMATE.start_main_~#guess~0.base_1| 400000) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_~#password~0.offset_1|) (= 0 |v_ULTIMATE.start_main_~#guess~0.offset_1|) (> 0 |v_ULTIMATE.start_main_~#guess~0.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#guess~0.base_1|)) (= v_ULTIMATE.start_main_~result~0_1 1) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#guess~0.base_1|) (= v_ULTIMATE.start_main_~i~0_1 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_~#guess~0.base_1| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#guess~0.base=|v_ULTIMATE.start_main_~#guess~0.base_1|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1, ULTIMATE.start_main_~#guess~0.offset=|v_ULTIMATE.start_main_~#guess~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~#password~0.offset=|v_ULTIMATE.start_main_~#password~0.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~#password~0.base=|v_ULTIMATE.start_main_~#password~0.base_1|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#guess~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~#guess~0.offset, ULTIMATE.start_main_~#password~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#password~0.base, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 4#L8-3true [2020-07-01 10:54:32,100 INFO L796 eck$LassoCheckResult]: Loop: 4#L8-3true [85] L8-3-->L9: Formula: (< v_ULTIMATE.start_main_~i~0_6 100000) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[] 13#L9true [77] L9-->L9-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_7))) (and (= 1 (select |v_#valid_6| |v_ULTIMATE.start_main_~#password~0.base_4|)) (<= 0 (+ .cse0 |v_ULTIMATE.start_main_~#password~0.offset_4|)) (<= (+ .cse0 |v_ULTIMATE.start_main_~#password~0.offset_4| 4) (select |v_#length_4| |v_ULTIMATE.start_main_~#password~0.base_4|)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| |v_ULTIMATE.start_main_~#password~0.base_4|) (+ (* v_ULTIMATE.start_main_~i~0_7 4) |v_ULTIMATE.start_main_~#password~0.offset_4|))))) InVars {ULTIMATE.start_main_~#password~0.offset=|v_ULTIMATE.start_main_~#password~0.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#password~0.base=|v_ULTIMATE.start_main_~#password~0.base_4|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~#password~0.offset=|v_ULTIMATE.start_main_~#password~0.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#password~0.base=|v_ULTIMATE.start_main_~#password~0.base_4|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, #length=|v_#length_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 11#L9-1true [74] L9-1-->L9-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_9))) (and (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#guess~0.base_4|) (+ |v_ULTIMATE.start_main_~#guess~0.offset_4| (* v_ULTIMATE.start_main_~i~0_9 4)))) (<= (+ |v_ULTIMATE.start_main_~#guess~0.offset_4| .cse0 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#guess~0.base_4|)) (= 1 (select |v_#valid_8| |v_ULTIMATE.start_main_~#guess~0.base_4|)) (<= 0 (+ |v_ULTIMATE.start_main_~#guess~0.offset_4| .cse0)))) InVars {ULTIMATE.start_main_~#guess~0.offset=|v_ULTIMATE.start_main_~#guess~0.offset_4|, ULTIMATE.start_main_~#guess~0.base=|v_ULTIMATE.start_main_~#guess~0.base_4|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~#guess~0.offset=|v_ULTIMATE.start_main_~#guess~0.offset_4|, ULTIMATE.start_main_~#guess~0.base=|v_ULTIMATE.start_main_~#guess~0.base_4|, #valid=|v_#valid_8|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, #length=|v_#length_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 9#L9-2true [133] L9-2-->L8-2: Formula: (and (= v_ULTIMATE.start_main_~result~0_4 0) (< |v_ULTIMATE.start_main_#t~mem2_4| |v_ULTIMATE.start_main_#t~mem1_4|)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_4|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_4|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_3|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, ULTIMATE.start_main_~result~0] 8#L8-2true [86] L8-2-->L8-3: Formula: (= v_ULTIMATE.start_main_~i~0_11 (+ v_ULTIMATE.start_main_~i~0_12 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 4#L8-3true [2020-07-01 10:54:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:32,100 INFO L82 PathProgramCache]: Analyzing trace with hash 3838, now seen corresponding path program 1 times [2020-07-01 10:54:32,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:32,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67672413] [2020-07-01 10:54:32,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:54:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:54:32,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67672413] [2020-07-01 10:54:32,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:54:32,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 10:54:32,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757147732] [2020-07-01 10:54:32,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 10:54:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:54:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash 109497666, now seen corresponding path program 1 times [2020-07-01 10:54:32,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:54:32,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349255643] [2020-07-01 10:54:32,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:54:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:54:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:54:32,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:54:32,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:54:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:54:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:54:32,188 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-07-01 10:54:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:54:32,224 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. [2020-07-01 10:54:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:54:32,227 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 10:54:32,231 INFO L168 Benchmark]: Toolchain (without parser) took 9208.67 ms. Allocated memory was 514.9 MB in the beginning and 670.0 MB in the end (delta: 155.2 MB). Free memory was 439.5 MB in the beginning and 577.1 MB in the end (delta: -137.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,231 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 460.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 10:54:32,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.95 ms. Allocated memory was 514.9 MB in the beginning and 571.5 MB in the end (delta: 56.6 MB). Free memory was 439.0 MB in the beginning and 537.9 MB in the end (delta: -98.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.85 ms. Allocated memory is still 571.5 MB. Free memory was 537.9 MB in the beginning and 536.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,232 INFO L168 Benchmark]: Boogie Preprocessor took 25.21 ms. Allocated memory is still 571.5 MB. Free memory was 536.3 MB in the beginning and 534.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,232 INFO L168 Benchmark]: RCFGBuilder took 324.42 ms. Allocated memory is still 571.5 MB. Free memory was 534.1 MB in the beginning and 515.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,233 INFO L168 Benchmark]: BlockEncodingV2 took 101.53 ms. Allocated memory is still 571.5 MB. Free memory was 515.3 MB in the beginning and 507.7 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,233 INFO L168 Benchmark]: TraceAbstraction took 8218.95 ms. Allocated memory was 571.5 MB in the beginning and 670.0 MB in the end (delta: 98.6 MB). Free memory was 507.2 MB in the beginning and 601.9 MB in the end (delta: -94.7 MB). Peak memory consumption was 3.8 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,233 INFO L168 Benchmark]: BuchiAutomizer took 180.91 ms. Allocated memory is still 670.0 MB. Free memory was 601.9 MB in the beginning and 577.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. [2020-07-01 10:54:32,236 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 34 edges - StatisticsResult: Encoded RCFG 22 locations, 40 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 460.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 311.95 ms. Allocated memory was 514.9 MB in the beginning and 571.5 MB in the end (delta: 56.6 MB). Free memory was 439.0 MB in the beginning and 537.9 MB in the end (delta: -98.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.85 ms. Allocated memory is still 571.5 MB. Free memory was 537.9 MB in the beginning and 536.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.21 ms. Allocated memory is still 571.5 MB. Free memory was 536.3 MB in the beginning and 534.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 324.42 ms. Allocated memory is still 571.5 MB. Free memory was 534.1 MB in the beginning and 515.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 101.53 ms. Allocated memory is still 571.5 MB. Free memory was 515.3 MB in the beginning and 507.7 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 8218.95 ms. Allocated memory was 571.5 MB in the beginning and 670.0 MB in the end (delta: 98.6 MB). Free memory was 507.2 MB in the beginning and 601.9 MB in the end (delta: -94.7 MB). Peak memory consumption was 3.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 180.91 ms. Allocated memory is still 670.0 MB. Free memory was 601.9 MB in the beginning and 577.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 10:54:32,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[guess] && 0 <= result) && guess <= 0) && 0 <= guess) && 0 == password) && 0 <= i) && 400000 == unknown-#length-unknown[password]) && 1 == \valid[password]) && 400000 == unknown-#length-unknown[guess] - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 10:54:32,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:54:32,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((1 <= i && 1 == \valid[guess]) && 0 <= password) && 0 <= 4 * x) && 0 <= result) && guess <= 0) && 0 <= guess) && 400000 == unknown-#length-unknown[password]) && password <= 0) && 1 == \valid[password]) && 400000 == unknown-#length-unknown[guess] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.9s, OverallIterations: 24, TraceHistogramMax: 7, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 505 SDslu, 608 SDs, 0 SdLazy, 1330 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 60 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 80 HoareAnnotationTreeSize, 2 FomulaSimplifications, 570 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 109 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 862 NumberOfCodeBlocks, 709 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 822 ConstructedInterpolants, 0 QuantifiedInterpolants, 118580 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1058 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 40 InterpolantComputations, 17 PerfectInterpolantSequences, 399/1119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 10:54:19.784 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_H3Bt3y/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 10:54:32.471 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check