/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:00:43,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:00:43,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:00:43,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:00:43,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:00:43,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:00:43,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:00:43,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:00:43,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:00:43,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:00:43,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:00:43,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:00:43,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:00:43,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:00:43,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:00:43,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:00:43,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:00:43,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:00:43,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:00:44,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:00:44,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:00:44,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:00:44,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:00:44,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:00:44,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:00:44,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:00:44,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:00:44,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:00:44,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:00:44,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:00:44,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:00:44,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:00:44,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:00:44,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:00:44,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:00:44,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:00:44,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:00:44,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:00:44,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:00:44,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:00:44,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:00:44,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:00:44,029 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:00:44,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:00:44,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:00:44,031 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:00:44,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:00:44,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:00:44,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:00:44,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:00:44,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:00:44,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:00:44,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:00:44,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:00:44,033 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:00:44,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:00:44,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:00:44,033 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:00:44,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:00:44,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:00:44,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:00:44,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:00:44,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:00:44,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:00:44,035 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:00:44,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:00:44,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:00:44,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:00:44,336 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:00:44,336 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:00:44,337 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-07-11 01:00:44,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726840a04/32a21c30e1ba4093a5ce98c8965a3e3b/FLAGa822533cf [2020-07-11 01:00:44,928 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:00:44,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-11 01:00:44,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726840a04/32a21c30e1ba4093a5ce98c8965a3e3b/FLAGa822533cf [2020-07-11 01:00:45,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726840a04/32a21c30e1ba4093a5ce98c8965a3e3b [2020-07-11 01:00:45,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:00:45,267 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:00:45,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:00:45,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:00:45,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:00:45,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4318e018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45, skipping insertion in model container [2020-07-11 01:00:45,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:00:45,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:00:45,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:00:45,510 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:00:45,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:00:45,579 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:00:45,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45 WrapperNode [2020-07-11 01:00:45,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:00:45,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:00:45,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:00:45,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:00:45,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... [2020-07-11 01:00:45,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:00:45,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:00:45,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:00:45,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:00:45,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:00:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:00:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:00:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:00:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:00:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:00:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:00:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:00:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:00:46,389 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:00:46,389 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 01:00:46,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:00:46 BoogieIcfgContainer [2020-07-11 01:00:46,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:00:46,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:00:46,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:00:46,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:00:46,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:00:45" (1/3) ... [2020-07-11 01:00:46,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72224bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:00:46, skipping insertion in model container [2020-07-11 01:00:46,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:45" (2/3) ... [2020-07-11 01:00:46,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72224bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:00:46, skipping insertion in model container [2020-07-11 01:00:46,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:00:46" (3/3) ... [2020-07-11 01:00:46,417 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-11 01:00:46,429 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:00:46,443 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:00:46,458 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:00:46,481 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:00:46,481 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:00:46,481 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:00:46,481 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:00:46,482 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:00:46,482 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:00:46,482 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:00:46,482 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:00:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-11 01:00:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-11 01:00:46,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:46,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:46,511 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1717644884, now seen corresponding path program 1 times [2020-07-11 01:00:46,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:46,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [27269899] [2020-07-11 01:00:46,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:46,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-11 01:00:46,773 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-11 01:00:46,775 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2020-07-11 01:00:46,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-11 01:00:46,777 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-11 01:00:46,777 INFO L263 TraceCheckUtils]: 3: Hoare triple {101#true} call #t~ret9 := main(); {101#true} is VALID [2020-07-11 01:00:46,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {101#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {101#true} ~p1~0 := #t~nondet0; {101#true} is VALID [2020-07-11 01:00:46,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {101#true} havoc #t~nondet0; {101#true} is VALID [2020-07-11 01:00:46,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} havoc ~lk1~0; {101#true} is VALID [2020-07-11 01:00:46,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {101#true} ~p2~0 := #t~nondet1; {101#true} is VALID [2020-07-11 01:00:46,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} havoc #t~nondet1; {101#true} is VALID [2020-07-11 01:00:46,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {101#true} havoc ~lk2~0; {101#true} is VALID [2020-07-11 01:00:46,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,781 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} ~p3~0 := #t~nondet2; {101#true} is VALID [2020-07-11 01:00:46,781 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} havoc #t~nondet2; {101#true} is VALID [2020-07-11 01:00:46,782 INFO L280 TraceCheckUtils]: 15: Hoare triple {101#true} havoc ~lk3~0; {101#true} is VALID [2020-07-11 01:00:46,782 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {101#true} ~p4~0 := #t~nondet3; {101#true} is VALID [2020-07-11 01:00:46,783 INFO L280 TraceCheckUtils]: 18: Hoare triple {101#true} havoc #t~nondet3; {101#true} is VALID [2020-07-11 01:00:46,783 INFO L280 TraceCheckUtils]: 19: Hoare triple {101#true} havoc ~lk4~0; {101#true} is VALID [2020-07-11 01:00:46,783 INFO L280 TraceCheckUtils]: 20: Hoare triple {101#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,784 INFO L280 TraceCheckUtils]: 21: Hoare triple {101#true} ~p5~0 := #t~nondet4; {101#true} is VALID [2020-07-11 01:00:46,784 INFO L280 TraceCheckUtils]: 22: Hoare triple {101#true} havoc #t~nondet4; {101#true} is VALID [2020-07-11 01:00:46,785 INFO L280 TraceCheckUtils]: 23: Hoare triple {101#true} havoc ~lk5~0; {101#true} is VALID [2020-07-11 01:00:46,785 INFO L280 TraceCheckUtils]: 24: Hoare triple {101#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,785 INFO L280 TraceCheckUtils]: 25: Hoare triple {101#true} ~p6~0 := #t~nondet5; {101#true} is VALID [2020-07-11 01:00:46,786 INFO L280 TraceCheckUtils]: 26: Hoare triple {101#true} havoc #t~nondet5; {101#true} is VALID [2020-07-11 01:00:46,786 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#true} havoc ~lk6~0; {101#true} is VALID [2020-07-11 01:00:46,787 INFO L280 TraceCheckUtils]: 28: Hoare triple {101#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,787 INFO L280 TraceCheckUtils]: 29: Hoare triple {101#true} ~p7~0 := #t~nondet6; {101#true} is VALID [2020-07-11 01:00:46,787 INFO L280 TraceCheckUtils]: 30: Hoare triple {101#true} havoc #t~nondet6; {101#true} is VALID [2020-07-11 01:00:46,788 INFO L280 TraceCheckUtils]: 31: Hoare triple {101#true} havoc ~lk7~0; {101#true} is VALID [2020-07-11 01:00:46,788 INFO L280 TraceCheckUtils]: 32: Hoare triple {101#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,788 INFO L280 TraceCheckUtils]: 33: Hoare triple {101#true} ~p8~0 := #t~nondet7; {101#true} is VALID [2020-07-11 01:00:46,789 INFO L280 TraceCheckUtils]: 34: Hoare triple {101#true} havoc #t~nondet7; {101#true} is VALID [2020-07-11 01:00:46,789 INFO L280 TraceCheckUtils]: 35: Hoare triple {101#true} havoc ~lk8~0; {101#true} is VALID [2020-07-11 01:00:46,790 INFO L280 TraceCheckUtils]: 36: Hoare triple {101#true} havoc ~cond~0; {101#true} is VALID [2020-07-11 01:00:46,790 INFO L280 TraceCheckUtils]: 37: Hoare triple {101#true} assume !false; {101#true} is VALID [2020-07-11 01:00:46,790 INFO L280 TraceCheckUtils]: 38: Hoare triple {101#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {101#true} is VALID [2020-07-11 01:00:46,791 INFO L280 TraceCheckUtils]: 39: Hoare triple {101#true} ~cond~0 := #t~nondet8; {101#true} is VALID [2020-07-11 01:00:46,791 INFO L280 TraceCheckUtils]: 40: Hoare triple {101#true} havoc #t~nondet8; {101#true} is VALID [2020-07-11 01:00:46,791 INFO L280 TraceCheckUtils]: 41: Hoare triple {101#true} assume !(0 == ~cond~0); {101#true} is VALID [2020-07-11 01:00:46,792 INFO L280 TraceCheckUtils]: 42: Hoare triple {101#true} ~lk1~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,792 INFO L280 TraceCheckUtils]: 43: Hoare triple {101#true} ~lk2~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,793 INFO L280 TraceCheckUtils]: 44: Hoare triple {101#true} ~lk3~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,793 INFO L280 TraceCheckUtils]: 45: Hoare triple {101#true} ~lk4~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,793 INFO L280 TraceCheckUtils]: 46: Hoare triple {101#true} ~lk5~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,794 INFO L280 TraceCheckUtils]: 47: Hoare triple {101#true} ~lk6~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,794 INFO L280 TraceCheckUtils]: 48: Hoare triple {101#true} ~lk7~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,795 INFO L280 TraceCheckUtils]: 49: Hoare triple {101#true} ~lk8~0 := 0; {101#true} is VALID [2020-07-11 01:00:46,796 INFO L280 TraceCheckUtils]: 50: Hoare triple {101#true} assume !(0 != ~p1~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,797 INFO L280 TraceCheckUtils]: 51: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,799 INFO L280 TraceCheckUtils]: 52: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,800 INFO L280 TraceCheckUtils]: 53: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,802 INFO L280 TraceCheckUtils]: 54: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,803 INFO L280 TraceCheckUtils]: 55: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,804 INFO L280 TraceCheckUtils]: 56: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,805 INFO L280 TraceCheckUtils]: 57: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:46,807 INFO L280 TraceCheckUtils]: 58: Hoare triple {105#(= 0 main_~p1~0)} assume 0 != ~p1~0; {102#false} is VALID [2020-07-11 01:00:46,808 INFO L280 TraceCheckUtils]: 59: Hoare triple {102#false} assume 1 != ~lk1~0; {102#false} is VALID [2020-07-11 01:00:46,808 INFO L280 TraceCheckUtils]: 60: Hoare triple {102#false} assume !false; {102#false} is VALID [2020-07-11 01:00:46,817 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-11 01:00:46,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [27269899] [2020-07-11 01:00:46,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:46,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:46,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860029879] [2020-07-11 01:00:46,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-11 01:00:46,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:46,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:46,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:46,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:46,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:46,948 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-07-11 01:00:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:47,498 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2020-07-11 01:00:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:47,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-11 01:00:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-11 01:00:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-11 01:00:47,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 291 transitions. [2020-07-11 01:00:47,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:47,914 INFO L225 Difference]: With dead ends: 213 [2020-07-11 01:00:47,914 INFO L226 Difference]: Without dead ends: 144 [2020-07-11 01:00:47,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-11 01:00:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-07-11 01:00:48,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:48,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 142 states. [2020-07-11 01:00:48,079 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 142 states. [2020-07-11 01:00:48,080 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 142 states. [2020-07-11 01:00:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:48,092 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-11 01:00:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-11 01:00:48,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:48,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:48,095 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 144 states. [2020-07-11 01:00:48,095 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 144 states. [2020-07-11 01:00:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:48,106 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-11 01:00:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-11 01:00:48,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:48,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:48,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:48,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-11 01:00:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2020-07-11 01:00:48,119 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 61 [2020-07-11 01:00:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:48,120 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2020-07-11 01:00:48,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:48,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 186 transitions. [2020-07-11 01:00:48,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2020-07-11 01:00:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-11 01:00:48,340 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:48,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:48,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:00:48,341 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 16380224, now seen corresponding path program 1 times [2020-07-11 01:00:48,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:48,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [645369833] [2020-07-11 01:00:48,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:48,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-11 01:00:48,444 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-11 01:00:48,444 INFO L263 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2020-07-11 01:00:48,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-11 01:00:48,445 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-11 01:00:48,445 INFO L263 TraceCheckUtils]: 3: Hoare triple {1106#true} call #t~ret9 := main(); {1106#true} is VALID [2020-07-11 01:00:48,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {1106#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,446 INFO L280 TraceCheckUtils]: 5: Hoare triple {1106#true} ~p1~0 := #t~nondet0; {1106#true} is VALID [2020-07-11 01:00:48,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {1106#true} havoc #t~nondet0; {1106#true} is VALID [2020-07-11 01:00:48,446 INFO L280 TraceCheckUtils]: 7: Hoare triple {1106#true} havoc ~lk1~0; {1106#true} is VALID [2020-07-11 01:00:48,446 INFO L280 TraceCheckUtils]: 8: Hoare triple {1106#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {1106#true} ~p2~0 := #t~nondet1; {1106#true} is VALID [2020-07-11 01:00:48,447 INFO L280 TraceCheckUtils]: 10: Hoare triple {1106#true} havoc #t~nondet1; {1106#true} is VALID [2020-07-11 01:00:48,447 INFO L280 TraceCheckUtils]: 11: Hoare triple {1106#true} havoc ~lk2~0; {1106#true} is VALID [2020-07-11 01:00:48,447 INFO L280 TraceCheckUtils]: 12: Hoare triple {1106#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,448 INFO L280 TraceCheckUtils]: 13: Hoare triple {1106#true} ~p3~0 := #t~nondet2; {1106#true} is VALID [2020-07-11 01:00:48,448 INFO L280 TraceCheckUtils]: 14: Hoare triple {1106#true} havoc #t~nondet2; {1106#true} is VALID [2020-07-11 01:00:48,448 INFO L280 TraceCheckUtils]: 15: Hoare triple {1106#true} havoc ~lk3~0; {1106#true} is VALID [2020-07-11 01:00:48,449 INFO L280 TraceCheckUtils]: 16: Hoare triple {1106#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,449 INFO L280 TraceCheckUtils]: 17: Hoare triple {1106#true} ~p4~0 := #t~nondet3; {1106#true} is VALID [2020-07-11 01:00:48,449 INFO L280 TraceCheckUtils]: 18: Hoare triple {1106#true} havoc #t~nondet3; {1106#true} is VALID [2020-07-11 01:00:48,449 INFO L280 TraceCheckUtils]: 19: Hoare triple {1106#true} havoc ~lk4~0; {1106#true} is VALID [2020-07-11 01:00:48,449 INFO L280 TraceCheckUtils]: 20: Hoare triple {1106#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,450 INFO L280 TraceCheckUtils]: 21: Hoare triple {1106#true} ~p5~0 := #t~nondet4; {1106#true} is VALID [2020-07-11 01:00:48,451 INFO L280 TraceCheckUtils]: 22: Hoare triple {1106#true} havoc #t~nondet4; {1106#true} is VALID [2020-07-11 01:00:48,451 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#true} havoc ~lk5~0; {1106#true} is VALID [2020-07-11 01:00:48,451 INFO L280 TraceCheckUtils]: 24: Hoare triple {1106#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,451 INFO L280 TraceCheckUtils]: 25: Hoare triple {1106#true} ~p6~0 := #t~nondet5; {1106#true} is VALID [2020-07-11 01:00:48,451 INFO L280 TraceCheckUtils]: 26: Hoare triple {1106#true} havoc #t~nondet5; {1106#true} is VALID [2020-07-11 01:00:48,452 INFO L280 TraceCheckUtils]: 27: Hoare triple {1106#true} havoc ~lk6~0; {1106#true} is VALID [2020-07-11 01:00:48,452 INFO L280 TraceCheckUtils]: 28: Hoare triple {1106#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,452 INFO L280 TraceCheckUtils]: 29: Hoare triple {1106#true} ~p7~0 := #t~nondet6; {1106#true} is VALID [2020-07-11 01:00:48,452 INFO L280 TraceCheckUtils]: 30: Hoare triple {1106#true} havoc #t~nondet6; {1106#true} is VALID [2020-07-11 01:00:48,452 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#true} havoc ~lk7~0; {1106#true} is VALID [2020-07-11 01:00:48,453 INFO L280 TraceCheckUtils]: 32: Hoare triple {1106#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,453 INFO L280 TraceCheckUtils]: 33: Hoare triple {1106#true} ~p8~0 := #t~nondet7; {1106#true} is VALID [2020-07-11 01:00:48,453 INFO L280 TraceCheckUtils]: 34: Hoare triple {1106#true} havoc #t~nondet7; {1106#true} is VALID [2020-07-11 01:00:48,454 INFO L280 TraceCheckUtils]: 35: Hoare triple {1106#true} havoc ~lk8~0; {1106#true} is VALID [2020-07-11 01:00:48,454 INFO L280 TraceCheckUtils]: 36: Hoare triple {1106#true} havoc ~cond~0; {1106#true} is VALID [2020-07-11 01:00:48,454 INFO L280 TraceCheckUtils]: 37: Hoare triple {1106#true} assume !false; {1106#true} is VALID [2020-07-11 01:00:48,454 INFO L280 TraceCheckUtils]: 38: Hoare triple {1106#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1106#true} is VALID [2020-07-11 01:00:48,454 INFO L280 TraceCheckUtils]: 39: Hoare triple {1106#true} ~cond~0 := #t~nondet8; {1106#true} is VALID [2020-07-11 01:00:48,458 INFO L280 TraceCheckUtils]: 40: Hoare triple {1106#true} havoc #t~nondet8; {1106#true} is VALID [2020-07-11 01:00:48,458 INFO L280 TraceCheckUtils]: 41: Hoare triple {1106#true} assume !(0 == ~cond~0); {1106#true} is VALID [2020-07-11 01:00:48,459 INFO L280 TraceCheckUtils]: 42: Hoare triple {1106#true} ~lk1~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,459 INFO L280 TraceCheckUtils]: 43: Hoare triple {1106#true} ~lk2~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,459 INFO L280 TraceCheckUtils]: 44: Hoare triple {1106#true} ~lk3~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,460 INFO L280 TraceCheckUtils]: 45: Hoare triple {1106#true} ~lk4~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,460 INFO L280 TraceCheckUtils]: 46: Hoare triple {1106#true} ~lk5~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,460 INFO L280 TraceCheckUtils]: 47: Hoare triple {1106#true} ~lk6~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,460 INFO L280 TraceCheckUtils]: 48: Hoare triple {1106#true} ~lk7~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,461 INFO L280 TraceCheckUtils]: 49: Hoare triple {1106#true} ~lk8~0 := 0; {1106#true} is VALID [2020-07-11 01:00:48,461 INFO L280 TraceCheckUtils]: 50: Hoare triple {1106#true} assume 0 != ~p1~0; {1106#true} is VALID [2020-07-11 01:00:48,462 INFO L280 TraceCheckUtils]: 51: Hoare triple {1106#true} ~lk1~0 := 1; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,462 INFO L280 TraceCheckUtils]: 52: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,462 INFO L280 TraceCheckUtils]: 53: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,463 INFO L280 TraceCheckUtils]: 54: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,463 INFO L280 TraceCheckUtils]: 55: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,464 INFO L280 TraceCheckUtils]: 56: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,465 INFO L280 TraceCheckUtils]: 57: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,466 INFO L280 TraceCheckUtils]: 58: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,466 INFO L280 TraceCheckUtils]: 59: Hoare triple {1110#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:48,467 INFO L280 TraceCheckUtils]: 60: Hoare triple {1110#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {1107#false} is VALID [2020-07-11 01:00:48,467 INFO L280 TraceCheckUtils]: 61: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2020-07-11 01:00:48,472 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-11 01:00:48,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [645369833] [2020-07-11 01:00:48,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:48,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:48,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588344823] [2020-07-11 01:00:48,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-11 01:00:48,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:48,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:48,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:48,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:48,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:48,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:48,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:48,540 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 3 states. [2020-07-11 01:00:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:48,909 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2020-07-11 01:00:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:48,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-11 01:00:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-11 01:00:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-11 01:00:48,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-11 01:00:49,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:49,103 INFO L225 Difference]: With dead ends: 173 [2020-07-11 01:00:49,104 INFO L226 Difference]: Without dead ends: 171 [2020-07-11 01:00:49,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-11 01:00:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2020-07-11 01:00:49,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:49,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 142 states. [2020-07-11 01:00:49,243 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 142 states. [2020-07-11 01:00:49,243 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 142 states. [2020-07-11 01:00:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:49,261 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-11 01:00:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-11 01:00:49,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:49,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:49,277 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 171 states. [2020-07-11 01:00:49,278 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 171 states. [2020-07-11 01:00:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:49,294 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-11 01:00:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-11 01:00:49,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:49,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:49,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:49,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-11 01:00:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2020-07-11 01:00:49,308 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 62 [2020-07-11 01:00:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:49,309 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2020-07-11 01:00:49,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:49,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 185 transitions. [2020-07-11 01:00:49,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2020-07-11 01:00:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-11 01:00:49,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:49,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:49,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:00:49,507 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:49,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1707628474, now seen corresponding path program 1 times [2020-07-11 01:00:49,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:49,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176053418] [2020-07-11 01:00:49,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:49,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-11 01:00:49,566 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-11 01:00:49,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2085#true} is VALID [2020-07-11 01:00:49,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-11 01:00:49,567 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-11 01:00:49,567 INFO L263 TraceCheckUtils]: 3: Hoare triple {2085#true} call #t~ret9 := main(); {2085#true} is VALID [2020-07-11 01:00:49,567 INFO L280 TraceCheckUtils]: 4: Hoare triple {2085#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,567 INFO L280 TraceCheckUtils]: 5: Hoare triple {2085#true} ~p1~0 := #t~nondet0; {2085#true} is VALID [2020-07-11 01:00:49,568 INFO L280 TraceCheckUtils]: 6: Hoare triple {2085#true} havoc #t~nondet0; {2085#true} is VALID [2020-07-11 01:00:49,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {2085#true} havoc ~lk1~0; {2085#true} is VALID [2020-07-11 01:00:49,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {2085#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {2085#true} ~p2~0 := #t~nondet1; {2085#true} is VALID [2020-07-11 01:00:49,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {2085#true} havoc #t~nondet1; {2085#true} is VALID [2020-07-11 01:00:49,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {2085#true} havoc ~lk2~0; {2085#true} is VALID [2020-07-11 01:00:49,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {2085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {2085#true} ~p3~0 := #t~nondet2; {2085#true} is VALID [2020-07-11 01:00:49,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {2085#true} havoc #t~nondet2; {2085#true} is VALID [2020-07-11 01:00:49,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {2085#true} havoc ~lk3~0; {2085#true} is VALID [2020-07-11 01:00:49,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {2085#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {2085#true} ~p4~0 := #t~nondet3; {2085#true} is VALID [2020-07-11 01:00:49,570 INFO L280 TraceCheckUtils]: 18: Hoare triple {2085#true} havoc #t~nondet3; {2085#true} is VALID [2020-07-11 01:00:49,571 INFO L280 TraceCheckUtils]: 19: Hoare triple {2085#true} havoc ~lk4~0; {2085#true} is VALID [2020-07-11 01:00:49,571 INFO L280 TraceCheckUtils]: 20: Hoare triple {2085#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,571 INFO L280 TraceCheckUtils]: 21: Hoare triple {2085#true} ~p5~0 := #t~nondet4; {2085#true} is VALID [2020-07-11 01:00:49,571 INFO L280 TraceCheckUtils]: 22: Hoare triple {2085#true} havoc #t~nondet4; {2085#true} is VALID [2020-07-11 01:00:49,572 INFO L280 TraceCheckUtils]: 23: Hoare triple {2085#true} havoc ~lk5~0; {2085#true} is VALID [2020-07-11 01:00:49,572 INFO L280 TraceCheckUtils]: 24: Hoare triple {2085#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,572 INFO L280 TraceCheckUtils]: 25: Hoare triple {2085#true} ~p6~0 := #t~nondet5; {2085#true} is VALID [2020-07-11 01:00:49,572 INFO L280 TraceCheckUtils]: 26: Hoare triple {2085#true} havoc #t~nondet5; {2085#true} is VALID [2020-07-11 01:00:49,572 INFO L280 TraceCheckUtils]: 27: Hoare triple {2085#true} havoc ~lk6~0; {2085#true} is VALID [2020-07-11 01:00:49,573 INFO L280 TraceCheckUtils]: 28: Hoare triple {2085#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,573 INFO L280 TraceCheckUtils]: 29: Hoare triple {2085#true} ~p7~0 := #t~nondet6; {2085#true} is VALID [2020-07-11 01:00:49,573 INFO L280 TraceCheckUtils]: 30: Hoare triple {2085#true} havoc #t~nondet6; {2085#true} is VALID [2020-07-11 01:00:49,573 INFO L280 TraceCheckUtils]: 31: Hoare triple {2085#true} havoc ~lk7~0; {2085#true} is VALID [2020-07-11 01:00:49,574 INFO L280 TraceCheckUtils]: 32: Hoare triple {2085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,574 INFO L280 TraceCheckUtils]: 33: Hoare triple {2085#true} ~p8~0 := #t~nondet7; {2085#true} is VALID [2020-07-11 01:00:49,574 INFO L280 TraceCheckUtils]: 34: Hoare triple {2085#true} havoc #t~nondet7; {2085#true} is VALID [2020-07-11 01:00:49,574 INFO L280 TraceCheckUtils]: 35: Hoare triple {2085#true} havoc ~lk8~0; {2085#true} is VALID [2020-07-11 01:00:49,575 INFO L280 TraceCheckUtils]: 36: Hoare triple {2085#true} havoc ~cond~0; {2085#true} is VALID [2020-07-11 01:00:49,575 INFO L280 TraceCheckUtils]: 37: Hoare triple {2085#true} assume !false; {2085#true} is VALID [2020-07-11 01:00:49,575 INFO L280 TraceCheckUtils]: 38: Hoare triple {2085#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2085#true} is VALID [2020-07-11 01:00:49,575 INFO L280 TraceCheckUtils]: 39: Hoare triple {2085#true} ~cond~0 := #t~nondet8; {2085#true} is VALID [2020-07-11 01:00:49,575 INFO L280 TraceCheckUtils]: 40: Hoare triple {2085#true} havoc #t~nondet8; {2085#true} is VALID [2020-07-11 01:00:49,576 INFO L280 TraceCheckUtils]: 41: Hoare triple {2085#true} assume !(0 == ~cond~0); {2085#true} is VALID [2020-07-11 01:00:49,576 INFO L280 TraceCheckUtils]: 42: Hoare triple {2085#true} ~lk1~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,576 INFO L280 TraceCheckUtils]: 43: Hoare triple {2085#true} ~lk2~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,576 INFO L280 TraceCheckUtils]: 44: Hoare triple {2085#true} ~lk3~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,577 INFO L280 TraceCheckUtils]: 45: Hoare triple {2085#true} ~lk4~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,577 INFO L280 TraceCheckUtils]: 46: Hoare triple {2085#true} ~lk5~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,577 INFO L280 TraceCheckUtils]: 47: Hoare triple {2085#true} ~lk6~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,577 INFO L280 TraceCheckUtils]: 48: Hoare triple {2085#true} ~lk7~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,578 INFO L280 TraceCheckUtils]: 49: Hoare triple {2085#true} ~lk8~0 := 0; {2085#true} is VALID [2020-07-11 01:00:49,578 INFO L280 TraceCheckUtils]: 50: Hoare triple {2085#true} assume !(0 != ~p1~0); {2085#true} is VALID [2020-07-11 01:00:49,579 INFO L280 TraceCheckUtils]: 51: Hoare triple {2085#true} assume !(0 != ~p2~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,579 INFO L280 TraceCheckUtils]: 52: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,580 INFO L280 TraceCheckUtils]: 53: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,580 INFO L280 TraceCheckUtils]: 54: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,581 INFO L280 TraceCheckUtils]: 55: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,581 INFO L280 TraceCheckUtils]: 56: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,582 INFO L280 TraceCheckUtils]: 57: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,583 INFO L280 TraceCheckUtils]: 58: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:49,583 INFO L280 TraceCheckUtils]: 59: Hoare triple {2089#(= 0 main_~p2~0)} assume 0 != ~p2~0; {2086#false} is VALID [2020-07-11 01:00:49,583 INFO L280 TraceCheckUtils]: 60: Hoare triple {2086#false} assume 1 != ~lk2~0; {2086#false} is VALID [2020-07-11 01:00:49,584 INFO L280 TraceCheckUtils]: 61: Hoare triple {2086#false} assume !false; {2086#false} is VALID [2020-07-11 01:00:49,587 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-11 01:00:49,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176053418] [2020-07-11 01:00:49,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:49,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:49,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998091670] [2020-07-11 01:00:49,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-11 01:00:49,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:49,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:49,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:49,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:49,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:49,641 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 3 states. [2020-07-11 01:00:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:50,145 INFO L93 Difference]: Finished difference Result 346 states and 473 transitions. [2020-07-11 01:00:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:50,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-11 01:00:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-11 01:00:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-11 01:00:50,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 264 transitions. [2020-07-11 01:00:50,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:50,420 INFO L225 Difference]: With dead ends: 346 [2020-07-11 01:00:50,421 INFO L226 Difference]: Without dead ends: 241 [2020-07-11 01:00:50,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-11 01:00:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2020-07-11 01:00:50,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:50,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 239 states. [2020-07-11 01:00:50,666 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 239 states. [2020-07-11 01:00:50,667 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 239 states. [2020-07-11 01:00:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:50,678 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-11 01:00:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-11 01:00:50,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:50,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:50,680 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 241 states. [2020-07-11 01:00:50,680 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 241 states. [2020-07-11 01:00:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:50,690 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-11 01:00:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-11 01:00:50,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:50,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:50,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:50,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-11 01:00:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2020-07-11 01:00:50,700 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 62 [2020-07-11 01:00:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:50,701 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2020-07-11 01:00:50,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:50,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 320 transitions. [2020-07-11 01:00:51,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2020-07-11 01:00:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-11 01:00:51,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:51,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:51,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:00:51,059 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash -298745719, now seen corresponding path program 1 times [2020-07-11 01:00:51,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:51,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575032926] [2020-07-11 01:00:51,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:51,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-11 01:00:51,133 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-11 01:00:51,134 INFO L263 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2020-07-11 01:00:51,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-11 01:00:51,134 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-11 01:00:51,134 INFO L263 TraceCheckUtils]: 3: Hoare triple {3744#true} call #t~ret9 := main(); {3744#true} is VALID [2020-07-11 01:00:51,135 INFO L280 TraceCheckUtils]: 4: Hoare triple {3744#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,135 INFO L280 TraceCheckUtils]: 5: Hoare triple {3744#true} ~p1~0 := #t~nondet0; {3744#true} is VALID [2020-07-11 01:00:51,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {3744#true} havoc #t~nondet0; {3744#true} is VALID [2020-07-11 01:00:51,135 INFO L280 TraceCheckUtils]: 7: Hoare triple {3744#true} havoc ~lk1~0; {3744#true} is VALID [2020-07-11 01:00:51,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {3744#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,136 INFO L280 TraceCheckUtils]: 9: Hoare triple {3744#true} ~p2~0 := #t~nondet1; {3744#true} is VALID [2020-07-11 01:00:51,136 INFO L280 TraceCheckUtils]: 10: Hoare triple {3744#true} havoc #t~nondet1; {3744#true} is VALID [2020-07-11 01:00:51,136 INFO L280 TraceCheckUtils]: 11: Hoare triple {3744#true} havoc ~lk2~0; {3744#true} is VALID [2020-07-11 01:00:51,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {3744#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {3744#true} ~p3~0 := #t~nondet2; {3744#true} is VALID [2020-07-11 01:00:51,137 INFO L280 TraceCheckUtils]: 14: Hoare triple {3744#true} havoc #t~nondet2; {3744#true} is VALID [2020-07-11 01:00:51,137 INFO L280 TraceCheckUtils]: 15: Hoare triple {3744#true} havoc ~lk3~0; {3744#true} is VALID [2020-07-11 01:00:51,137 INFO L280 TraceCheckUtils]: 16: Hoare triple {3744#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,138 INFO L280 TraceCheckUtils]: 17: Hoare triple {3744#true} ~p4~0 := #t~nondet3; {3744#true} is VALID [2020-07-11 01:00:51,138 INFO L280 TraceCheckUtils]: 18: Hoare triple {3744#true} havoc #t~nondet3; {3744#true} is VALID [2020-07-11 01:00:51,138 INFO L280 TraceCheckUtils]: 19: Hoare triple {3744#true} havoc ~lk4~0; {3744#true} is VALID [2020-07-11 01:00:51,138 INFO L280 TraceCheckUtils]: 20: Hoare triple {3744#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,138 INFO L280 TraceCheckUtils]: 21: Hoare triple {3744#true} ~p5~0 := #t~nondet4; {3744#true} is VALID [2020-07-11 01:00:51,139 INFO L280 TraceCheckUtils]: 22: Hoare triple {3744#true} havoc #t~nondet4; {3744#true} is VALID [2020-07-11 01:00:51,139 INFO L280 TraceCheckUtils]: 23: Hoare triple {3744#true} havoc ~lk5~0; {3744#true} is VALID [2020-07-11 01:00:51,139 INFO L280 TraceCheckUtils]: 24: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,139 INFO L280 TraceCheckUtils]: 25: Hoare triple {3744#true} ~p6~0 := #t~nondet5; {3744#true} is VALID [2020-07-11 01:00:51,139 INFO L280 TraceCheckUtils]: 26: Hoare triple {3744#true} havoc #t~nondet5; {3744#true} is VALID [2020-07-11 01:00:51,139 INFO L280 TraceCheckUtils]: 27: Hoare triple {3744#true} havoc ~lk6~0; {3744#true} is VALID [2020-07-11 01:00:51,140 INFO L280 TraceCheckUtils]: 28: Hoare triple {3744#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,140 INFO L280 TraceCheckUtils]: 29: Hoare triple {3744#true} ~p7~0 := #t~nondet6; {3744#true} is VALID [2020-07-11 01:00:51,140 INFO L280 TraceCheckUtils]: 30: Hoare triple {3744#true} havoc #t~nondet6; {3744#true} is VALID [2020-07-11 01:00:51,140 INFO L280 TraceCheckUtils]: 31: Hoare triple {3744#true} havoc ~lk7~0; {3744#true} is VALID [2020-07-11 01:00:51,140 INFO L280 TraceCheckUtils]: 32: Hoare triple {3744#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,140 INFO L280 TraceCheckUtils]: 33: Hoare triple {3744#true} ~p8~0 := #t~nondet7; {3744#true} is VALID [2020-07-11 01:00:51,140 INFO L280 TraceCheckUtils]: 34: Hoare triple {3744#true} havoc #t~nondet7; {3744#true} is VALID [2020-07-11 01:00:51,141 INFO L280 TraceCheckUtils]: 35: Hoare triple {3744#true} havoc ~lk8~0; {3744#true} is VALID [2020-07-11 01:00:51,141 INFO L280 TraceCheckUtils]: 36: Hoare triple {3744#true} havoc ~cond~0; {3744#true} is VALID [2020-07-11 01:00:51,141 INFO L280 TraceCheckUtils]: 37: Hoare triple {3744#true} assume !false; {3744#true} is VALID [2020-07-11 01:00:51,141 INFO L280 TraceCheckUtils]: 38: Hoare triple {3744#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3744#true} is VALID [2020-07-11 01:00:51,141 INFO L280 TraceCheckUtils]: 39: Hoare triple {3744#true} ~cond~0 := #t~nondet8; {3744#true} is VALID [2020-07-11 01:00:51,142 INFO L280 TraceCheckUtils]: 40: Hoare triple {3744#true} havoc #t~nondet8; {3744#true} is VALID [2020-07-11 01:00:51,142 INFO L280 TraceCheckUtils]: 41: Hoare triple {3744#true} assume !(0 == ~cond~0); {3744#true} is VALID [2020-07-11 01:00:51,142 INFO L280 TraceCheckUtils]: 42: Hoare triple {3744#true} ~lk1~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,142 INFO L280 TraceCheckUtils]: 43: Hoare triple {3744#true} ~lk2~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,142 INFO L280 TraceCheckUtils]: 44: Hoare triple {3744#true} ~lk3~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,142 INFO L280 TraceCheckUtils]: 45: Hoare triple {3744#true} ~lk4~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,143 INFO L280 TraceCheckUtils]: 46: Hoare triple {3744#true} ~lk5~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,143 INFO L280 TraceCheckUtils]: 47: Hoare triple {3744#true} ~lk6~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,143 INFO L280 TraceCheckUtils]: 48: Hoare triple {3744#true} ~lk7~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,143 INFO L280 TraceCheckUtils]: 49: Hoare triple {3744#true} ~lk8~0 := 0; {3744#true} is VALID [2020-07-11 01:00:51,143 INFO L280 TraceCheckUtils]: 50: Hoare triple {3744#true} assume !(0 != ~p1~0); {3744#true} is VALID [2020-07-11 01:00:51,143 INFO L280 TraceCheckUtils]: 51: Hoare triple {3744#true} assume 0 != ~p2~0; {3744#true} is VALID [2020-07-11 01:00:51,144 INFO L280 TraceCheckUtils]: 52: Hoare triple {3744#true} ~lk2~0 := 1; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,144 INFO L280 TraceCheckUtils]: 53: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,145 INFO L280 TraceCheckUtils]: 54: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,145 INFO L280 TraceCheckUtils]: 55: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,146 INFO L280 TraceCheckUtils]: 56: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,146 INFO L280 TraceCheckUtils]: 57: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,147 INFO L280 TraceCheckUtils]: 58: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,149 INFO L280 TraceCheckUtils]: 59: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,149 INFO L280 TraceCheckUtils]: 60: Hoare triple {3748#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:51,151 INFO L280 TraceCheckUtils]: 61: Hoare triple {3748#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3745#false} is VALID [2020-07-11 01:00:51,152 INFO L280 TraceCheckUtils]: 62: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2020-07-11 01:00:51,155 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-11 01:00:51,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575032926] [2020-07-11 01:00:51,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:51,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:51,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347686772] [2020-07-11 01:00:51,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-11 01:00:51,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:51,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:51,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:51,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:51,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:51,220 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand 3 states. [2020-07-11 01:00:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:51,707 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2020-07-11 01:00:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:51,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-11 01:00:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-11 01:00:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-11 01:00:51,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-11 01:00:51,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:51,878 INFO L225 Difference]: With dead ends: 293 [2020-07-11 01:00:51,878 INFO L226 Difference]: Without dead ends: 291 [2020-07-11 01:00:51,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-11 01:00:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2020-07-11 01:00:52,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:52,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 239 states. [2020-07-11 01:00:52,122 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 239 states. [2020-07-11 01:00:52,122 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 239 states. [2020-07-11 01:00:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:52,135 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-11 01:00:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-11 01:00:52,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:52,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:52,137 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 291 states. [2020-07-11 01:00:52,138 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 291 states. [2020-07-11 01:00:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:52,152 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-11 01:00:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-11 01:00:52,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:52,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:52,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:52,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-11 01:00:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 318 transitions. [2020-07-11 01:00:52,163 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 318 transitions. Word has length 63 [2020-07-11 01:00:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:52,163 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 318 transitions. [2020-07-11 01:00:52,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:52,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 318 transitions. [2020-07-11 01:00:52,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 318 transitions. [2020-07-11 01:00:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-11 01:00:52,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:52,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:52,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:00:52,487 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:52,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1397120136, now seen corresponding path program 1 times [2020-07-11 01:00:52,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:52,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [139492627] [2020-07-11 01:00:52,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:52,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-11 01:00:52,555 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-11 01:00:52,555 INFO L263 TraceCheckUtils]: 0: Hoare triple {5397#true} call ULTIMATE.init(); {5397#true} is VALID [2020-07-11 01:00:52,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-11 01:00:52,555 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-11 01:00:52,556 INFO L263 TraceCheckUtils]: 3: Hoare triple {5397#true} call #t~ret9 := main(); {5397#true} is VALID [2020-07-11 01:00:52,556 INFO L280 TraceCheckUtils]: 4: Hoare triple {5397#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {5397#true} ~p1~0 := #t~nondet0; {5397#true} is VALID [2020-07-11 01:00:52,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {5397#true} havoc #t~nondet0; {5397#true} is VALID [2020-07-11 01:00:52,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {5397#true} havoc ~lk1~0; {5397#true} is VALID [2020-07-11 01:00:52,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {5397#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {5397#true} ~p2~0 := #t~nondet1; {5397#true} is VALID [2020-07-11 01:00:52,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {5397#true} havoc #t~nondet1; {5397#true} is VALID [2020-07-11 01:00:52,557 INFO L280 TraceCheckUtils]: 11: Hoare triple {5397#true} havoc ~lk2~0; {5397#true} is VALID [2020-07-11 01:00:52,557 INFO L280 TraceCheckUtils]: 12: Hoare triple {5397#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,557 INFO L280 TraceCheckUtils]: 13: Hoare triple {5397#true} ~p3~0 := #t~nondet2; {5397#true} is VALID [2020-07-11 01:00:52,557 INFO L280 TraceCheckUtils]: 14: Hoare triple {5397#true} havoc #t~nondet2; {5397#true} is VALID [2020-07-11 01:00:52,558 INFO L280 TraceCheckUtils]: 15: Hoare triple {5397#true} havoc ~lk3~0; {5397#true} is VALID [2020-07-11 01:00:52,558 INFO L280 TraceCheckUtils]: 16: Hoare triple {5397#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,558 INFO L280 TraceCheckUtils]: 17: Hoare triple {5397#true} ~p4~0 := #t~nondet3; {5397#true} is VALID [2020-07-11 01:00:52,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {5397#true} havoc #t~nondet3; {5397#true} is VALID [2020-07-11 01:00:52,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {5397#true} havoc ~lk4~0; {5397#true} is VALID [2020-07-11 01:00:52,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {5397#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,559 INFO L280 TraceCheckUtils]: 21: Hoare triple {5397#true} ~p5~0 := #t~nondet4; {5397#true} is VALID [2020-07-11 01:00:52,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {5397#true} havoc #t~nondet4; {5397#true} is VALID [2020-07-11 01:00:52,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {5397#true} havoc ~lk5~0; {5397#true} is VALID [2020-07-11 01:00:52,560 INFO L280 TraceCheckUtils]: 24: Hoare triple {5397#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {5397#true} ~p6~0 := #t~nondet5; {5397#true} is VALID [2020-07-11 01:00:52,560 INFO L280 TraceCheckUtils]: 26: Hoare triple {5397#true} havoc #t~nondet5; {5397#true} is VALID [2020-07-11 01:00:52,560 INFO L280 TraceCheckUtils]: 27: Hoare triple {5397#true} havoc ~lk6~0; {5397#true} is VALID [2020-07-11 01:00:52,560 INFO L280 TraceCheckUtils]: 28: Hoare triple {5397#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {5397#true} ~p7~0 := #t~nondet6; {5397#true} is VALID [2020-07-11 01:00:52,561 INFO L280 TraceCheckUtils]: 30: Hoare triple {5397#true} havoc #t~nondet6; {5397#true} is VALID [2020-07-11 01:00:52,561 INFO L280 TraceCheckUtils]: 31: Hoare triple {5397#true} havoc ~lk7~0; {5397#true} is VALID [2020-07-11 01:00:52,561 INFO L280 TraceCheckUtils]: 32: Hoare triple {5397#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,562 INFO L280 TraceCheckUtils]: 33: Hoare triple {5397#true} ~p8~0 := #t~nondet7; {5397#true} is VALID [2020-07-11 01:00:52,562 INFO L280 TraceCheckUtils]: 34: Hoare triple {5397#true} havoc #t~nondet7; {5397#true} is VALID [2020-07-11 01:00:52,562 INFO L280 TraceCheckUtils]: 35: Hoare triple {5397#true} havoc ~lk8~0; {5397#true} is VALID [2020-07-11 01:00:52,562 INFO L280 TraceCheckUtils]: 36: Hoare triple {5397#true} havoc ~cond~0; {5397#true} is VALID [2020-07-11 01:00:52,562 INFO L280 TraceCheckUtils]: 37: Hoare triple {5397#true} assume !false; {5397#true} is VALID [2020-07-11 01:00:52,563 INFO L280 TraceCheckUtils]: 38: Hoare triple {5397#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5397#true} is VALID [2020-07-11 01:00:52,563 INFO L280 TraceCheckUtils]: 39: Hoare triple {5397#true} ~cond~0 := #t~nondet8; {5397#true} is VALID [2020-07-11 01:00:52,563 INFO L280 TraceCheckUtils]: 40: Hoare triple {5397#true} havoc #t~nondet8; {5397#true} is VALID [2020-07-11 01:00:52,563 INFO L280 TraceCheckUtils]: 41: Hoare triple {5397#true} assume !(0 == ~cond~0); {5397#true} is VALID [2020-07-11 01:00:52,563 INFO L280 TraceCheckUtils]: 42: Hoare triple {5397#true} ~lk1~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,564 INFO L280 TraceCheckUtils]: 43: Hoare triple {5397#true} ~lk2~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,564 INFO L280 TraceCheckUtils]: 44: Hoare triple {5397#true} ~lk3~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,564 INFO L280 TraceCheckUtils]: 45: Hoare triple {5397#true} ~lk4~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,564 INFO L280 TraceCheckUtils]: 46: Hoare triple {5397#true} ~lk5~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,564 INFO L280 TraceCheckUtils]: 47: Hoare triple {5397#true} ~lk6~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,565 INFO L280 TraceCheckUtils]: 48: Hoare triple {5397#true} ~lk7~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,565 INFO L280 TraceCheckUtils]: 49: Hoare triple {5397#true} ~lk8~0 := 0; {5397#true} is VALID [2020-07-11 01:00:52,565 INFO L280 TraceCheckUtils]: 50: Hoare triple {5397#true} assume !(0 != ~p1~0); {5397#true} is VALID [2020-07-11 01:00:52,565 INFO L280 TraceCheckUtils]: 51: Hoare triple {5397#true} assume !(0 != ~p2~0); {5397#true} is VALID [2020-07-11 01:00:52,567 INFO L280 TraceCheckUtils]: 52: Hoare triple {5397#true} assume !(0 != ~p3~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,569 INFO L280 TraceCheckUtils]: 53: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,570 INFO L280 TraceCheckUtils]: 54: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,571 INFO L280 TraceCheckUtils]: 55: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,572 INFO L280 TraceCheckUtils]: 56: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,573 INFO L280 TraceCheckUtils]: 57: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,573 INFO L280 TraceCheckUtils]: 58: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,574 INFO L280 TraceCheckUtils]: 59: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:52,574 INFO L280 TraceCheckUtils]: 60: Hoare triple {5401#(= 0 main_~p3~0)} assume 0 != ~p3~0; {5398#false} is VALID [2020-07-11 01:00:52,574 INFO L280 TraceCheckUtils]: 61: Hoare triple {5398#false} assume 1 != ~lk3~0; {5398#false} is VALID [2020-07-11 01:00:52,575 INFO L280 TraceCheckUtils]: 62: Hoare triple {5398#false} assume !false; {5398#false} is VALID [2020-07-11 01:00:52,578 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-11 01:00:52,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [139492627] [2020-07-11 01:00:52,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:52,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:52,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209358303] [2020-07-11 01:00:52,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-11 01:00:52,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:52,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:52,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:52,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:52,643 INFO L87 Difference]: Start difference. First operand 239 states and 318 transitions. Second operand 3 states. [2020-07-11 01:00:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:53,480 INFO L93 Difference]: Finished difference Result 631 states and 864 transitions. [2020-07-11 01:00:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:53,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-11 01:00:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-11 01:00:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-11 01:00:53,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-11 01:00:53,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:53,747 INFO L225 Difference]: With dead ends: 631 [2020-07-11 01:00:53,748 INFO L226 Difference]: Without dead ends: 429 [2020-07-11 01:00:53,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-11 01:00:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-07-11 01:00:54,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:54,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand 427 states. [2020-07-11 01:00:54,267 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand 427 states. [2020-07-11 01:00:54,267 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 427 states. [2020-07-11 01:00:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:54,284 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-11 01:00:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-11 01:00:54,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:54,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:54,286 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand 429 states. [2020-07-11 01:00:54,286 INFO L87 Difference]: Start difference. First operand 427 states. Second operand 429 states. [2020-07-11 01:00:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:54,301 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-11 01:00:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-11 01:00:54,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:54,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:54,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:54,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-07-11 01:00:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2020-07-11 01:00:54,318 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 63 [2020-07-11 01:00:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:54,318 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2020-07-11 01:00:54,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:54,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 427 states and 574 transitions. [2020-07-11 01:00:54,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2020-07-11 01:00:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-11 01:00:54,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:54,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:54,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:00:54,965 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 361296622, now seen corresponding path program 1 times [2020-07-11 01:00:54,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:54,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296946253] [2020-07-11 01:00:54,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:55,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-11 01:00:55,039 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-11 01:00:55,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {8378#true} call ULTIMATE.init(); {8378#true} is VALID [2020-07-11 01:00:55,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-11 01:00:55,040 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-11 01:00:55,040 INFO L263 TraceCheckUtils]: 3: Hoare triple {8378#true} call #t~ret9 := main(); {8378#true} is VALID [2020-07-11 01:00:55,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {8378#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {8378#true} ~p1~0 := #t~nondet0; {8378#true} is VALID [2020-07-11 01:00:55,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {8378#true} havoc #t~nondet0; {8378#true} is VALID [2020-07-11 01:00:55,041 INFO L280 TraceCheckUtils]: 7: Hoare triple {8378#true} havoc ~lk1~0; {8378#true} is VALID [2020-07-11 01:00:55,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {8378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {8378#true} ~p2~0 := #t~nondet1; {8378#true} is VALID [2020-07-11 01:00:55,042 INFO L280 TraceCheckUtils]: 10: Hoare triple {8378#true} havoc #t~nondet1; {8378#true} is VALID [2020-07-11 01:00:55,042 INFO L280 TraceCheckUtils]: 11: Hoare triple {8378#true} havoc ~lk2~0; {8378#true} is VALID [2020-07-11 01:00:55,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {8378#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {8378#true} ~p3~0 := #t~nondet2; {8378#true} is VALID [2020-07-11 01:00:55,043 INFO L280 TraceCheckUtils]: 14: Hoare triple {8378#true} havoc #t~nondet2; {8378#true} is VALID [2020-07-11 01:00:55,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {8378#true} havoc ~lk3~0; {8378#true} is VALID [2020-07-11 01:00:55,043 INFO L280 TraceCheckUtils]: 16: Hoare triple {8378#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,043 INFO L280 TraceCheckUtils]: 17: Hoare triple {8378#true} ~p4~0 := #t~nondet3; {8378#true} is VALID [2020-07-11 01:00:55,043 INFO L280 TraceCheckUtils]: 18: Hoare triple {8378#true} havoc #t~nondet3; {8378#true} is VALID [2020-07-11 01:00:55,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {8378#true} havoc ~lk4~0; {8378#true} is VALID [2020-07-11 01:00:55,044 INFO L280 TraceCheckUtils]: 20: Hoare triple {8378#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,044 INFO L280 TraceCheckUtils]: 21: Hoare triple {8378#true} ~p5~0 := #t~nondet4; {8378#true} is VALID [2020-07-11 01:00:55,044 INFO L280 TraceCheckUtils]: 22: Hoare triple {8378#true} havoc #t~nondet4; {8378#true} is VALID [2020-07-11 01:00:55,045 INFO L280 TraceCheckUtils]: 23: Hoare triple {8378#true} havoc ~lk5~0; {8378#true} is VALID [2020-07-11 01:00:55,045 INFO L280 TraceCheckUtils]: 24: Hoare triple {8378#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,045 INFO L280 TraceCheckUtils]: 25: Hoare triple {8378#true} ~p6~0 := #t~nondet5; {8378#true} is VALID [2020-07-11 01:00:55,045 INFO L280 TraceCheckUtils]: 26: Hoare triple {8378#true} havoc #t~nondet5; {8378#true} is VALID [2020-07-11 01:00:55,046 INFO L280 TraceCheckUtils]: 27: Hoare triple {8378#true} havoc ~lk6~0; {8378#true} is VALID [2020-07-11 01:00:55,046 INFO L280 TraceCheckUtils]: 28: Hoare triple {8378#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,046 INFO L280 TraceCheckUtils]: 29: Hoare triple {8378#true} ~p7~0 := #t~nondet6; {8378#true} is VALID [2020-07-11 01:00:55,046 INFO L280 TraceCheckUtils]: 30: Hoare triple {8378#true} havoc #t~nondet6; {8378#true} is VALID [2020-07-11 01:00:55,046 INFO L280 TraceCheckUtils]: 31: Hoare triple {8378#true} havoc ~lk7~0; {8378#true} is VALID [2020-07-11 01:00:55,047 INFO L280 TraceCheckUtils]: 32: Hoare triple {8378#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,047 INFO L280 TraceCheckUtils]: 33: Hoare triple {8378#true} ~p8~0 := #t~nondet7; {8378#true} is VALID [2020-07-11 01:00:55,047 INFO L280 TraceCheckUtils]: 34: Hoare triple {8378#true} havoc #t~nondet7; {8378#true} is VALID [2020-07-11 01:00:55,048 INFO L280 TraceCheckUtils]: 35: Hoare triple {8378#true} havoc ~lk8~0; {8378#true} is VALID [2020-07-11 01:00:55,048 INFO L280 TraceCheckUtils]: 36: Hoare triple {8378#true} havoc ~cond~0; {8378#true} is VALID [2020-07-11 01:00:55,048 INFO L280 TraceCheckUtils]: 37: Hoare triple {8378#true} assume !false; {8378#true} is VALID [2020-07-11 01:00:55,049 INFO L280 TraceCheckUtils]: 38: Hoare triple {8378#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8378#true} is VALID [2020-07-11 01:00:55,049 INFO L280 TraceCheckUtils]: 39: Hoare triple {8378#true} ~cond~0 := #t~nondet8; {8378#true} is VALID [2020-07-11 01:00:55,049 INFO L280 TraceCheckUtils]: 40: Hoare triple {8378#true} havoc #t~nondet8; {8378#true} is VALID [2020-07-11 01:00:55,049 INFO L280 TraceCheckUtils]: 41: Hoare triple {8378#true} assume !(0 == ~cond~0); {8378#true} is VALID [2020-07-11 01:00:55,050 INFO L280 TraceCheckUtils]: 42: Hoare triple {8378#true} ~lk1~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,050 INFO L280 TraceCheckUtils]: 43: Hoare triple {8378#true} ~lk2~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,050 INFO L280 TraceCheckUtils]: 44: Hoare triple {8378#true} ~lk3~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,050 INFO L280 TraceCheckUtils]: 45: Hoare triple {8378#true} ~lk4~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,051 INFO L280 TraceCheckUtils]: 46: Hoare triple {8378#true} ~lk5~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,051 INFO L280 TraceCheckUtils]: 47: Hoare triple {8378#true} ~lk6~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,051 INFO L280 TraceCheckUtils]: 48: Hoare triple {8378#true} ~lk7~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,052 INFO L280 TraceCheckUtils]: 49: Hoare triple {8378#true} ~lk8~0 := 0; {8378#true} is VALID [2020-07-11 01:00:55,052 INFO L280 TraceCheckUtils]: 50: Hoare triple {8378#true} assume !(0 != ~p1~0); {8378#true} is VALID [2020-07-11 01:00:55,052 INFO L280 TraceCheckUtils]: 51: Hoare triple {8378#true} assume !(0 != ~p2~0); {8378#true} is VALID [2020-07-11 01:00:55,052 INFO L280 TraceCheckUtils]: 52: Hoare triple {8378#true} assume !(0 != ~p3~0); {8378#true} is VALID [2020-07-11 01:00:55,053 INFO L280 TraceCheckUtils]: 53: Hoare triple {8378#true} assume !(0 != ~p4~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,055 INFO L280 TraceCheckUtils]: 54: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,056 INFO L280 TraceCheckUtils]: 55: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,057 INFO L280 TraceCheckUtils]: 56: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,058 INFO L280 TraceCheckUtils]: 57: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,058 INFO L280 TraceCheckUtils]: 58: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,059 INFO L280 TraceCheckUtils]: 59: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,061 INFO L280 TraceCheckUtils]: 60: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:55,062 INFO L280 TraceCheckUtils]: 61: Hoare triple {8382#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8379#false} is VALID [2020-07-11 01:00:55,063 INFO L280 TraceCheckUtils]: 62: Hoare triple {8379#false} assume 1 != ~lk4~0; {8379#false} is VALID [2020-07-11 01:00:55,063 INFO L280 TraceCheckUtils]: 63: Hoare triple {8379#false} assume !false; {8379#false} is VALID [2020-07-11 01:00:55,065 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-11 01:00:55,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296946253] [2020-07-11 01:00:55,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:55,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:55,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648449182] [2020-07-11 01:00:55,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-11 01:00:55,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:55,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:55,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:55,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:55,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:55,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:55,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:55,134 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand 3 states. [2020-07-11 01:00:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:56,701 INFO L93 Difference]: Finished difference Result 1183 states and 1616 transitions. [2020-07-11 01:00:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:56,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-11 01:00:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-11 01:00:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-11 01:00:56,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-11 01:00:56,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:57,006 INFO L225 Difference]: With dead ends: 1183 [2020-07-11 01:00:57,006 INFO L226 Difference]: Without dead ends: 793 [2020-07-11 01:00:57,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-07-11 01:00:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2020-07-11 01:00:58,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:58,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 793 states. Second operand 791 states. [2020-07-11 01:00:58,335 INFO L74 IsIncluded]: Start isIncluded. First operand 793 states. Second operand 791 states. [2020-07-11 01:00:58,335 INFO L87 Difference]: Start difference. First operand 793 states. Second operand 791 states. [2020-07-11 01:00:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:58,378 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-11 01:00:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-11 01:00:58,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:58,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:58,381 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 793 states. [2020-07-11 01:00:58,381 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 793 states. [2020-07-11 01:00:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:58,420 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-11 01:00:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-11 01:00:58,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:58,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:58,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:58,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-11 01:00:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1062 transitions. [2020-07-11 01:00:58,464 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1062 transitions. Word has length 64 [2020-07-11 01:00:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:58,465 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1062 transitions. [2020-07-11 01:00:58,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:58,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1062 transitions. [2020-07-11 01:00:59,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1062 edges. 1062 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1062 transitions. [2020-07-11 01:00:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-11 01:00:59,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:59,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:59,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:00:59,658 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1477714988, now seen corresponding path program 1 times [2020-07-11 01:00:59,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:59,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114838454] [2020-07-11 01:00:59,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:59,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-11 01:00:59,703 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-11 01:00:59,703 INFO L263 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2020-07-11 01:00:59,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-11 01:00:59,704 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-11 01:00:59,704 INFO L263 TraceCheckUtils]: 3: Hoare triple {13919#true} call #t~ret9 := main(); {13919#true} is VALID [2020-07-11 01:00:59,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {13919#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {13919#true} ~p1~0 := #t~nondet0; {13919#true} is VALID [2020-07-11 01:00:59,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {13919#true} havoc #t~nondet0; {13919#true} is VALID [2020-07-11 01:00:59,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {13919#true} havoc ~lk1~0; {13919#true} is VALID [2020-07-11 01:00:59,705 INFO L280 TraceCheckUtils]: 8: Hoare triple {13919#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {13919#true} ~p2~0 := #t~nondet1; {13919#true} is VALID [2020-07-11 01:00:59,705 INFO L280 TraceCheckUtils]: 10: Hoare triple {13919#true} havoc #t~nondet1; {13919#true} is VALID [2020-07-11 01:00:59,705 INFO L280 TraceCheckUtils]: 11: Hoare triple {13919#true} havoc ~lk2~0; {13919#true} is VALID [2020-07-11 01:00:59,705 INFO L280 TraceCheckUtils]: 12: Hoare triple {13919#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,705 INFO L280 TraceCheckUtils]: 13: Hoare triple {13919#true} ~p3~0 := #t~nondet2; {13919#true} is VALID [2020-07-11 01:00:59,705 INFO L280 TraceCheckUtils]: 14: Hoare triple {13919#true} havoc #t~nondet2; {13919#true} is VALID [2020-07-11 01:00:59,706 INFO L280 TraceCheckUtils]: 15: Hoare triple {13919#true} havoc ~lk3~0; {13919#true} is VALID [2020-07-11 01:00:59,706 INFO L280 TraceCheckUtils]: 16: Hoare triple {13919#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,706 INFO L280 TraceCheckUtils]: 17: Hoare triple {13919#true} ~p4~0 := #t~nondet3; {13919#true} is VALID [2020-07-11 01:00:59,706 INFO L280 TraceCheckUtils]: 18: Hoare triple {13919#true} havoc #t~nondet3; {13919#true} is VALID [2020-07-11 01:00:59,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {13919#true} havoc ~lk4~0; {13919#true} is VALID [2020-07-11 01:00:59,706 INFO L280 TraceCheckUtils]: 20: Hoare triple {13919#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,706 INFO L280 TraceCheckUtils]: 21: Hoare triple {13919#true} ~p5~0 := #t~nondet4; {13919#true} is VALID [2020-07-11 01:00:59,707 INFO L280 TraceCheckUtils]: 22: Hoare triple {13919#true} havoc #t~nondet4; {13919#true} is VALID [2020-07-11 01:00:59,707 INFO L280 TraceCheckUtils]: 23: Hoare triple {13919#true} havoc ~lk5~0; {13919#true} is VALID [2020-07-11 01:00:59,707 INFO L280 TraceCheckUtils]: 24: Hoare triple {13919#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,707 INFO L280 TraceCheckUtils]: 25: Hoare triple {13919#true} ~p6~0 := #t~nondet5; {13919#true} is VALID [2020-07-11 01:00:59,707 INFO L280 TraceCheckUtils]: 26: Hoare triple {13919#true} havoc #t~nondet5; {13919#true} is VALID [2020-07-11 01:00:59,707 INFO L280 TraceCheckUtils]: 27: Hoare triple {13919#true} havoc ~lk6~0; {13919#true} is VALID [2020-07-11 01:00:59,707 INFO L280 TraceCheckUtils]: 28: Hoare triple {13919#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 29: Hoare triple {13919#true} ~p7~0 := #t~nondet6; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 30: Hoare triple {13919#true} havoc #t~nondet6; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 31: Hoare triple {13919#true} havoc ~lk7~0; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 32: Hoare triple {13919#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 33: Hoare triple {13919#true} ~p8~0 := #t~nondet7; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 34: Hoare triple {13919#true} havoc #t~nondet7; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 35: Hoare triple {13919#true} havoc ~lk8~0; {13919#true} is VALID [2020-07-11 01:00:59,708 INFO L280 TraceCheckUtils]: 36: Hoare triple {13919#true} havoc ~cond~0; {13919#true} is VALID [2020-07-11 01:00:59,709 INFO L280 TraceCheckUtils]: 37: Hoare triple {13919#true} assume !false; {13919#true} is VALID [2020-07-11 01:00:59,709 INFO L280 TraceCheckUtils]: 38: Hoare triple {13919#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13919#true} is VALID [2020-07-11 01:00:59,709 INFO L280 TraceCheckUtils]: 39: Hoare triple {13919#true} ~cond~0 := #t~nondet8; {13919#true} is VALID [2020-07-11 01:00:59,709 INFO L280 TraceCheckUtils]: 40: Hoare triple {13919#true} havoc #t~nondet8; {13919#true} is VALID [2020-07-11 01:00:59,709 INFO L280 TraceCheckUtils]: 41: Hoare triple {13919#true} assume !(0 == ~cond~0); {13919#true} is VALID [2020-07-11 01:00:59,709 INFO L280 TraceCheckUtils]: 42: Hoare triple {13919#true} ~lk1~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,709 INFO L280 TraceCheckUtils]: 43: Hoare triple {13919#true} ~lk2~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,710 INFO L280 TraceCheckUtils]: 44: Hoare triple {13919#true} ~lk3~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,710 INFO L280 TraceCheckUtils]: 45: Hoare triple {13919#true} ~lk4~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,710 INFO L280 TraceCheckUtils]: 46: Hoare triple {13919#true} ~lk5~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,710 INFO L280 TraceCheckUtils]: 47: Hoare triple {13919#true} ~lk6~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,710 INFO L280 TraceCheckUtils]: 48: Hoare triple {13919#true} ~lk7~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,711 INFO L280 TraceCheckUtils]: 49: Hoare triple {13919#true} ~lk8~0 := 0; {13919#true} is VALID [2020-07-11 01:00:59,711 INFO L280 TraceCheckUtils]: 50: Hoare triple {13919#true} assume !(0 != ~p1~0); {13919#true} is VALID [2020-07-11 01:00:59,711 INFO L280 TraceCheckUtils]: 51: Hoare triple {13919#true} assume !(0 != ~p2~0); {13919#true} is VALID [2020-07-11 01:00:59,711 INFO L280 TraceCheckUtils]: 52: Hoare triple {13919#true} assume 0 != ~p3~0; {13919#true} is VALID [2020-07-11 01:00:59,714 INFO L280 TraceCheckUtils]: 53: Hoare triple {13919#true} ~lk3~0 := 1; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,714 INFO L280 TraceCheckUtils]: 54: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,715 INFO L280 TraceCheckUtils]: 55: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,715 INFO L280 TraceCheckUtils]: 56: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,716 INFO L280 TraceCheckUtils]: 57: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,717 INFO L280 TraceCheckUtils]: 58: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,717 INFO L280 TraceCheckUtils]: 59: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,717 INFO L280 TraceCheckUtils]: 60: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,718 INFO L280 TraceCheckUtils]: 61: Hoare triple {13923#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:59,718 INFO L280 TraceCheckUtils]: 62: Hoare triple {13923#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {13920#false} is VALID [2020-07-11 01:00:59,719 INFO L280 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2020-07-11 01:00:59,723 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-11 01:00:59,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114838454] [2020-07-11 01:00:59,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:59,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:59,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628264738] [2020-07-11 01:00:59,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-11 01:00:59,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:59,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:59,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:59,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:59,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:59,785 INFO L87 Difference]: Start difference. First operand 791 states and 1062 transitions. Second operand 3 states. [2020-07-11 01:01:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:01,663 INFO L93 Difference]: Finished difference Result 971 states and 1312 transitions. [2020-07-11 01:01:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:01:01,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-11 01:01:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:01:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-11 01:01:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-11 01:01:01,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2020-07-11 01:01:01,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:01,949 INFO L225 Difference]: With dead ends: 971 [2020-07-11 01:01:01,950 INFO L226 Difference]: Without dead ends: 969 [2020-07-11 01:01:01,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:01:01,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-11 01:01:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 791. [2020-07-11 01:01:03,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:03,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand 791 states. [2020-07-11 01:01:03,281 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand 791 states. [2020-07-11 01:01:03,281 INFO L87 Difference]: Start difference. First operand 969 states. Second operand 791 states. [2020-07-11 01:01:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:03,320 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-11 01:01:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-11 01:01:03,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:03,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:03,322 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 969 states. [2020-07-11 01:01:03,323 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 969 states. [2020-07-11 01:01:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:03,363 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-11 01:01:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-11 01:01:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:03,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:03,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:03,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-11 01:01:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1054 transitions. [2020-07-11 01:01:03,393 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1054 transitions. Word has length 64 [2020-07-11 01:01:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:03,393 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1054 transitions. [2020-07-11 01:01:03,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:03,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1054 transitions. [2020-07-11 01:01:04,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1054 edges. 1054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1054 transitions. [2020-07-11 01:01:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-11 01:01:04,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:04,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:01:04,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:01:04,698 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash 628943709, now seen corresponding path program 1 times [2020-07-11 01:01:04,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:04,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248702099] [2020-07-11 01:01:04,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:04,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-11 01:01:04,796 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-11 01:01:04,796 INFO L263 TraceCheckUtils]: 0: Hoare triple {19388#true} call ULTIMATE.init(); {19388#true} is VALID [2020-07-11 01:01:04,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-11 01:01:04,797 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-11 01:01:04,797 INFO L263 TraceCheckUtils]: 3: Hoare triple {19388#true} call #t~ret9 := main(); {19388#true} is VALID [2020-07-11 01:01:04,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {19388#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,798 INFO L280 TraceCheckUtils]: 5: Hoare triple {19388#true} ~p1~0 := #t~nondet0; {19388#true} is VALID [2020-07-11 01:01:04,798 INFO L280 TraceCheckUtils]: 6: Hoare triple {19388#true} havoc #t~nondet0; {19388#true} is VALID [2020-07-11 01:01:04,798 INFO L280 TraceCheckUtils]: 7: Hoare triple {19388#true} havoc ~lk1~0; {19388#true} is VALID [2020-07-11 01:01:04,799 INFO L280 TraceCheckUtils]: 8: Hoare triple {19388#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,799 INFO L280 TraceCheckUtils]: 9: Hoare triple {19388#true} ~p2~0 := #t~nondet1; {19388#true} is VALID [2020-07-11 01:01:04,799 INFO L280 TraceCheckUtils]: 10: Hoare triple {19388#true} havoc #t~nondet1; {19388#true} is VALID [2020-07-11 01:01:04,800 INFO L280 TraceCheckUtils]: 11: Hoare triple {19388#true} havoc ~lk2~0; {19388#true} is VALID [2020-07-11 01:01:04,800 INFO L280 TraceCheckUtils]: 12: Hoare triple {19388#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,800 INFO L280 TraceCheckUtils]: 13: Hoare triple {19388#true} ~p3~0 := #t~nondet2; {19388#true} is VALID [2020-07-11 01:01:04,800 INFO L280 TraceCheckUtils]: 14: Hoare triple {19388#true} havoc #t~nondet2; {19388#true} is VALID [2020-07-11 01:01:04,801 INFO L280 TraceCheckUtils]: 15: Hoare triple {19388#true} havoc ~lk3~0; {19388#true} is VALID [2020-07-11 01:01:04,801 INFO L280 TraceCheckUtils]: 16: Hoare triple {19388#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,801 INFO L280 TraceCheckUtils]: 17: Hoare triple {19388#true} ~p4~0 := #t~nondet3; {19388#true} is VALID [2020-07-11 01:01:04,802 INFO L280 TraceCheckUtils]: 18: Hoare triple {19388#true} havoc #t~nondet3; {19388#true} is VALID [2020-07-11 01:01:04,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {19388#true} havoc ~lk4~0; {19388#true} is VALID [2020-07-11 01:01:04,802 INFO L280 TraceCheckUtils]: 20: Hoare triple {19388#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,803 INFO L280 TraceCheckUtils]: 21: Hoare triple {19388#true} ~p5~0 := #t~nondet4; {19388#true} is VALID [2020-07-11 01:01:04,803 INFO L280 TraceCheckUtils]: 22: Hoare triple {19388#true} havoc #t~nondet4; {19388#true} is VALID [2020-07-11 01:01:04,803 INFO L280 TraceCheckUtils]: 23: Hoare triple {19388#true} havoc ~lk5~0; {19388#true} is VALID [2020-07-11 01:01:04,803 INFO L280 TraceCheckUtils]: 24: Hoare triple {19388#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,804 INFO L280 TraceCheckUtils]: 25: Hoare triple {19388#true} ~p6~0 := #t~nondet5; {19388#true} is VALID [2020-07-11 01:01:04,804 INFO L280 TraceCheckUtils]: 26: Hoare triple {19388#true} havoc #t~nondet5; {19388#true} is VALID [2020-07-11 01:01:04,804 INFO L280 TraceCheckUtils]: 27: Hoare triple {19388#true} havoc ~lk6~0; {19388#true} is VALID [2020-07-11 01:01:04,805 INFO L280 TraceCheckUtils]: 28: Hoare triple {19388#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,805 INFO L280 TraceCheckUtils]: 29: Hoare triple {19388#true} ~p7~0 := #t~nondet6; {19388#true} is VALID [2020-07-11 01:01:04,805 INFO L280 TraceCheckUtils]: 30: Hoare triple {19388#true} havoc #t~nondet6; {19388#true} is VALID [2020-07-11 01:01:04,806 INFO L280 TraceCheckUtils]: 31: Hoare triple {19388#true} havoc ~lk7~0; {19388#true} is VALID [2020-07-11 01:01:04,806 INFO L280 TraceCheckUtils]: 32: Hoare triple {19388#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,806 INFO L280 TraceCheckUtils]: 33: Hoare triple {19388#true} ~p8~0 := #t~nondet7; {19388#true} is VALID [2020-07-11 01:01:04,806 INFO L280 TraceCheckUtils]: 34: Hoare triple {19388#true} havoc #t~nondet7; {19388#true} is VALID [2020-07-11 01:01:04,807 INFO L280 TraceCheckUtils]: 35: Hoare triple {19388#true} havoc ~lk8~0; {19388#true} is VALID [2020-07-11 01:01:04,807 INFO L280 TraceCheckUtils]: 36: Hoare triple {19388#true} havoc ~cond~0; {19388#true} is VALID [2020-07-11 01:01:04,807 INFO L280 TraceCheckUtils]: 37: Hoare triple {19388#true} assume !false; {19388#true} is VALID [2020-07-11 01:01:04,808 INFO L280 TraceCheckUtils]: 38: Hoare triple {19388#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {19388#true} is VALID [2020-07-11 01:01:04,808 INFO L280 TraceCheckUtils]: 39: Hoare triple {19388#true} ~cond~0 := #t~nondet8; {19388#true} is VALID [2020-07-11 01:01:04,808 INFO L280 TraceCheckUtils]: 40: Hoare triple {19388#true} havoc #t~nondet8; {19388#true} is VALID [2020-07-11 01:01:04,808 INFO L280 TraceCheckUtils]: 41: Hoare triple {19388#true} assume !(0 == ~cond~0); {19388#true} is VALID [2020-07-11 01:01:04,809 INFO L280 TraceCheckUtils]: 42: Hoare triple {19388#true} ~lk1~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,809 INFO L280 TraceCheckUtils]: 43: Hoare triple {19388#true} ~lk2~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,809 INFO L280 TraceCheckUtils]: 44: Hoare triple {19388#true} ~lk3~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,810 INFO L280 TraceCheckUtils]: 45: Hoare triple {19388#true} ~lk4~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,810 INFO L280 TraceCheckUtils]: 46: Hoare triple {19388#true} ~lk5~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,810 INFO L280 TraceCheckUtils]: 47: Hoare triple {19388#true} ~lk6~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,811 INFO L280 TraceCheckUtils]: 48: Hoare triple {19388#true} ~lk7~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,811 INFO L280 TraceCheckUtils]: 49: Hoare triple {19388#true} ~lk8~0 := 0; {19388#true} is VALID [2020-07-11 01:01:04,811 INFO L280 TraceCheckUtils]: 50: Hoare triple {19388#true} assume !(0 != ~p1~0); {19388#true} is VALID [2020-07-11 01:01:04,811 INFO L280 TraceCheckUtils]: 51: Hoare triple {19388#true} assume !(0 != ~p2~0); {19388#true} is VALID [2020-07-11 01:01:04,812 INFO L280 TraceCheckUtils]: 52: Hoare triple {19388#true} assume !(0 != ~p3~0); {19388#true} is VALID [2020-07-11 01:01:04,812 INFO L280 TraceCheckUtils]: 53: Hoare triple {19388#true} assume 0 != ~p4~0; {19388#true} is VALID [2020-07-11 01:01:04,815 INFO L280 TraceCheckUtils]: 54: Hoare triple {19388#true} ~lk4~0 := 1; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,816 INFO L280 TraceCheckUtils]: 55: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,817 INFO L280 TraceCheckUtils]: 56: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,842 INFO L280 TraceCheckUtils]: 57: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,843 INFO L280 TraceCheckUtils]: 58: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,844 INFO L280 TraceCheckUtils]: 59: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,847 INFO L280 TraceCheckUtils]: 60: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,847 INFO L280 TraceCheckUtils]: 61: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,848 INFO L280 TraceCheckUtils]: 62: Hoare triple {19392#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:01:04,849 INFO L280 TraceCheckUtils]: 63: Hoare triple {19392#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {19389#false} is VALID [2020-07-11 01:01:04,849 INFO L280 TraceCheckUtils]: 64: Hoare triple {19389#false} assume !false; {19389#false} is VALID [2020-07-11 01:01:04,854 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-11 01:01:04,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248702099] [2020-07-11 01:01:04,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:04,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:04,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605821246] [2020-07-11 01:01:04,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-11 01:01:04,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:04,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:04,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:04,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:04,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:04,926 INFO L87 Difference]: Start difference. First operand 791 states and 1054 transitions. Second operand 3 states. [2020-07-11 01:01:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:06,901 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2020-07-11 01:01:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:01:06,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-11 01:01:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:01:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-11 01:01:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-11 01:01:06,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-11 01:01:07,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:07,114 INFO L225 Difference]: With dead ends: 963 [2020-07-11 01:01:07,115 INFO L226 Difference]: Without dead ends: 961 [2020-07-11 01:01:07,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:01:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-07-11 01:01:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 791. [2020-07-11 01:01:08,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:08,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 961 states. Second operand 791 states. [2020-07-11 01:01:08,524 INFO L74 IsIncluded]: Start isIncluded. First operand 961 states. Second operand 791 states. [2020-07-11 01:01:08,524 INFO L87 Difference]: Start difference. First operand 961 states. Second operand 791 states. [2020-07-11 01:01:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:08,560 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-11 01:01:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-11 01:01:08,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:08,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:08,562 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 961 states. [2020-07-11 01:01:08,562 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 961 states. [2020-07-11 01:01:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:08,613 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-11 01:01:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-11 01:01:08,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:08,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:08,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:08,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-11 01:01:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1046 transitions. [2020-07-11 01:01:08,651 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1046 transitions. Word has length 65 [2020-07-11 01:01:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:08,651 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1046 transitions. [2020-07-11 01:01:08,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:08,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1046 transitions. [2020-07-11 01:01:09,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1046 edges. 1046 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1046 transitions. [2020-07-11 01:01:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-11 01:01:09,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:09,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:01:09,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:01:09,876 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1684460868, now seen corresponding path program 1 times [2020-07-11 01:01:09,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:09,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903458080] [2020-07-11 01:01:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:09,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-11 01:01:09,929 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-11 01:01:09,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {24825#true} call ULTIMATE.init(); {24825#true} is VALID [2020-07-11 01:01:09,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-11 01:01:09,929 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-11 01:01:09,930 INFO L263 TraceCheckUtils]: 3: Hoare triple {24825#true} call #t~ret9 := main(); {24825#true} is VALID [2020-07-11 01:01:09,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {24825#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {24825#true} ~p1~0 := #t~nondet0; {24825#true} is VALID [2020-07-11 01:01:09,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {24825#true} havoc #t~nondet0; {24825#true} is VALID [2020-07-11 01:01:09,930 INFO L280 TraceCheckUtils]: 7: Hoare triple {24825#true} havoc ~lk1~0; {24825#true} is VALID [2020-07-11 01:01:09,930 INFO L280 TraceCheckUtils]: 8: Hoare triple {24825#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,931 INFO L280 TraceCheckUtils]: 9: Hoare triple {24825#true} ~p2~0 := #t~nondet1; {24825#true} is VALID [2020-07-11 01:01:09,931 INFO L280 TraceCheckUtils]: 10: Hoare triple {24825#true} havoc #t~nondet1; {24825#true} is VALID [2020-07-11 01:01:09,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {24825#true} havoc ~lk2~0; {24825#true} is VALID [2020-07-11 01:01:09,931 INFO L280 TraceCheckUtils]: 12: Hoare triple {24825#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,931 INFO L280 TraceCheckUtils]: 13: Hoare triple {24825#true} ~p3~0 := #t~nondet2; {24825#true} is VALID [2020-07-11 01:01:09,932 INFO L280 TraceCheckUtils]: 14: Hoare triple {24825#true} havoc #t~nondet2; {24825#true} is VALID [2020-07-11 01:01:09,932 INFO L280 TraceCheckUtils]: 15: Hoare triple {24825#true} havoc ~lk3~0; {24825#true} is VALID [2020-07-11 01:01:09,932 INFO L280 TraceCheckUtils]: 16: Hoare triple {24825#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,932 INFO L280 TraceCheckUtils]: 17: Hoare triple {24825#true} ~p4~0 := #t~nondet3; {24825#true} is VALID [2020-07-11 01:01:09,932 INFO L280 TraceCheckUtils]: 18: Hoare triple {24825#true} havoc #t~nondet3; {24825#true} is VALID [2020-07-11 01:01:09,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {24825#true} havoc ~lk4~0; {24825#true} is VALID [2020-07-11 01:01:09,933 INFO L280 TraceCheckUtils]: 20: Hoare triple {24825#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,933 INFO L280 TraceCheckUtils]: 21: Hoare triple {24825#true} ~p5~0 := #t~nondet4; {24825#true} is VALID [2020-07-11 01:01:09,933 INFO L280 TraceCheckUtils]: 22: Hoare triple {24825#true} havoc #t~nondet4; {24825#true} is VALID [2020-07-11 01:01:09,933 INFO L280 TraceCheckUtils]: 23: Hoare triple {24825#true} havoc ~lk5~0; {24825#true} is VALID [2020-07-11 01:01:09,933 INFO L280 TraceCheckUtils]: 24: Hoare triple {24825#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,933 INFO L280 TraceCheckUtils]: 25: Hoare triple {24825#true} ~p6~0 := #t~nondet5; {24825#true} is VALID [2020-07-11 01:01:09,934 INFO L280 TraceCheckUtils]: 26: Hoare triple {24825#true} havoc #t~nondet5; {24825#true} is VALID [2020-07-11 01:01:09,934 INFO L280 TraceCheckUtils]: 27: Hoare triple {24825#true} havoc ~lk6~0; {24825#true} is VALID [2020-07-11 01:01:09,934 INFO L280 TraceCheckUtils]: 28: Hoare triple {24825#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,934 INFO L280 TraceCheckUtils]: 29: Hoare triple {24825#true} ~p7~0 := #t~nondet6; {24825#true} is VALID [2020-07-11 01:01:09,934 INFO L280 TraceCheckUtils]: 30: Hoare triple {24825#true} havoc #t~nondet6; {24825#true} is VALID [2020-07-11 01:01:09,934 INFO L280 TraceCheckUtils]: 31: Hoare triple {24825#true} havoc ~lk7~0; {24825#true} is VALID [2020-07-11 01:01:09,935 INFO L280 TraceCheckUtils]: 32: Hoare triple {24825#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,935 INFO L280 TraceCheckUtils]: 33: Hoare triple {24825#true} ~p8~0 := #t~nondet7; {24825#true} is VALID [2020-07-11 01:01:09,935 INFO L280 TraceCheckUtils]: 34: Hoare triple {24825#true} havoc #t~nondet7; {24825#true} is VALID [2020-07-11 01:01:09,935 INFO L280 TraceCheckUtils]: 35: Hoare triple {24825#true} havoc ~lk8~0; {24825#true} is VALID [2020-07-11 01:01:09,935 INFO L280 TraceCheckUtils]: 36: Hoare triple {24825#true} havoc ~cond~0; {24825#true} is VALID [2020-07-11 01:01:09,935 INFO L280 TraceCheckUtils]: 37: Hoare triple {24825#true} assume !false; {24825#true} is VALID [2020-07-11 01:01:09,936 INFO L280 TraceCheckUtils]: 38: Hoare triple {24825#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {24825#true} is VALID [2020-07-11 01:01:09,936 INFO L280 TraceCheckUtils]: 39: Hoare triple {24825#true} ~cond~0 := #t~nondet8; {24825#true} is VALID [2020-07-11 01:01:09,936 INFO L280 TraceCheckUtils]: 40: Hoare triple {24825#true} havoc #t~nondet8; {24825#true} is VALID [2020-07-11 01:01:09,936 INFO L280 TraceCheckUtils]: 41: Hoare triple {24825#true} assume !(0 == ~cond~0); {24825#true} is VALID [2020-07-11 01:01:09,936 INFO L280 TraceCheckUtils]: 42: Hoare triple {24825#true} ~lk1~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,936 INFO L280 TraceCheckUtils]: 43: Hoare triple {24825#true} ~lk2~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,937 INFO L280 TraceCheckUtils]: 44: Hoare triple {24825#true} ~lk3~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,937 INFO L280 TraceCheckUtils]: 45: Hoare triple {24825#true} ~lk4~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,937 INFO L280 TraceCheckUtils]: 46: Hoare triple {24825#true} ~lk5~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,937 INFO L280 TraceCheckUtils]: 47: Hoare triple {24825#true} ~lk6~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,937 INFO L280 TraceCheckUtils]: 48: Hoare triple {24825#true} ~lk7~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,938 INFO L280 TraceCheckUtils]: 49: Hoare triple {24825#true} ~lk8~0 := 0; {24825#true} is VALID [2020-07-11 01:01:09,938 INFO L280 TraceCheckUtils]: 50: Hoare triple {24825#true} assume !(0 != ~p1~0); {24825#true} is VALID [2020-07-11 01:01:09,938 INFO L280 TraceCheckUtils]: 51: Hoare triple {24825#true} assume !(0 != ~p2~0); {24825#true} is VALID [2020-07-11 01:01:09,938 INFO L280 TraceCheckUtils]: 52: Hoare triple {24825#true} assume !(0 != ~p3~0); {24825#true} is VALID [2020-07-11 01:01:09,938 INFO L280 TraceCheckUtils]: 53: Hoare triple {24825#true} assume !(0 != ~p4~0); {24825#true} is VALID [2020-07-11 01:01:09,939 INFO L280 TraceCheckUtils]: 54: Hoare triple {24825#true} assume !(0 != ~p5~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,939 INFO L280 TraceCheckUtils]: 55: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,940 INFO L280 TraceCheckUtils]: 56: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,940 INFO L280 TraceCheckUtils]: 57: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,941 INFO L280 TraceCheckUtils]: 58: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,941 INFO L280 TraceCheckUtils]: 59: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,942 INFO L280 TraceCheckUtils]: 60: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,942 INFO L280 TraceCheckUtils]: 61: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-11 01:01:09,943 INFO L280 TraceCheckUtils]: 62: Hoare triple {24829#(= 0 main_~p5~0)} assume 0 != ~p5~0; {24826#false} is VALID [2020-07-11 01:01:09,943 INFO L280 TraceCheckUtils]: 63: Hoare triple {24826#false} assume 1 != ~lk5~0; {24826#false} is VALID [2020-07-11 01:01:09,943 INFO L280 TraceCheckUtils]: 64: Hoare triple {24826#false} assume !false; {24826#false} is VALID [2020-07-11 01:01:09,946 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-11 01:01:09,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903458080] [2020-07-11 01:01:09,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:09,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:09,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529635838] [2020-07-11 01:01:09,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-11 01:01:09,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:09,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:10,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:10,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:10,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:10,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:10,003 INFO L87 Difference]: Start difference. First operand 791 states and 1046 transitions. Second operand 3 states. [2020-07-11 01:01:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:13,547 INFO L93 Difference]: Finished difference Result 2251 states and 3000 transitions. [2020-07-11 01:01:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:01:13,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-11 01:01:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:01:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-11 01:01:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-11 01:01:13,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2020-07-11 01:01:13,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:13,870 INFO L225 Difference]: With dead ends: 2251 [2020-07-11 01:01:13,870 INFO L226 Difference]: Without dead ends: 1497 [2020-07-11 01:01:13,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:01:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2020-07-11 01:01:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2020-07-11 01:01:16,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:16,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1497 states. Second operand 1495 states. [2020-07-11 01:01:16,948 INFO L74 IsIncluded]: Start isIncluded. First operand 1497 states. Second operand 1495 states. [2020-07-11 01:01:16,948 INFO L87 Difference]: Start difference. First operand 1497 states. Second operand 1495 states. [2020-07-11 01:01:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:17,019 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-11 01:01:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-11 01:01:17,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:17,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:17,022 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1497 states. [2020-07-11 01:01:17,022 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1497 states. [2020-07-11 01:01:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:17,115 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-11 01:01:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-11 01:01:17,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:17,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:17,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:17,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-11 01:01:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1958 transitions. [2020-07-11 01:01:17,191 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1958 transitions. Word has length 65 [2020-07-11 01:01:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:17,191 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1958 transitions. [2020-07-11 01:01:17,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:17,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1958 transitions. [2020-07-11 01:01:19,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1958 edges. 1958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1958 transitions. [2020-07-11 01:01:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-11 01:01:19,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:19,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:01:19,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 01:01:19,673 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1510854248, now seen corresponding path program 1 times [2020-07-11 01:01:19,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:19,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038733328] [2020-07-11 01:01:19,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:19,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-11 01:01:19,738 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-11 01:01:19,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {35318#true} call ULTIMATE.init(); {35318#true} is VALID [2020-07-11 01:01:19,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-11 01:01:19,738 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-11 01:01:19,739 INFO L263 TraceCheckUtils]: 3: Hoare triple {35318#true} call #t~ret9 := main(); {35318#true} is VALID [2020-07-11 01:01:19,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {35318#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {35318#true} ~p1~0 := #t~nondet0; {35318#true} is VALID [2020-07-11 01:01:19,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {35318#true} havoc #t~nondet0; {35318#true} is VALID [2020-07-11 01:01:19,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {35318#true} havoc ~lk1~0; {35318#true} is VALID [2020-07-11 01:01:19,740 INFO L280 TraceCheckUtils]: 8: Hoare triple {35318#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,740 INFO L280 TraceCheckUtils]: 9: Hoare triple {35318#true} ~p2~0 := #t~nondet1; {35318#true} is VALID [2020-07-11 01:01:19,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {35318#true} havoc #t~nondet1; {35318#true} is VALID [2020-07-11 01:01:19,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {35318#true} havoc ~lk2~0; {35318#true} is VALID [2020-07-11 01:01:19,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {35318#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {35318#true} ~p3~0 := #t~nondet2; {35318#true} is VALID [2020-07-11 01:01:19,741 INFO L280 TraceCheckUtils]: 14: Hoare triple {35318#true} havoc #t~nondet2; {35318#true} is VALID [2020-07-11 01:01:19,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {35318#true} havoc ~lk3~0; {35318#true} is VALID [2020-07-11 01:01:19,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {35318#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {35318#true} ~p4~0 := #t~nondet3; {35318#true} is VALID [2020-07-11 01:01:19,741 INFO L280 TraceCheckUtils]: 18: Hoare triple {35318#true} havoc #t~nondet3; {35318#true} is VALID [2020-07-11 01:01:19,742 INFO L280 TraceCheckUtils]: 19: Hoare triple {35318#true} havoc ~lk4~0; {35318#true} is VALID [2020-07-11 01:01:19,742 INFO L280 TraceCheckUtils]: 20: Hoare triple {35318#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,742 INFO L280 TraceCheckUtils]: 21: Hoare triple {35318#true} ~p5~0 := #t~nondet4; {35318#true} is VALID [2020-07-11 01:01:19,742 INFO L280 TraceCheckUtils]: 22: Hoare triple {35318#true} havoc #t~nondet4; {35318#true} is VALID [2020-07-11 01:01:19,742 INFO L280 TraceCheckUtils]: 23: Hoare triple {35318#true} havoc ~lk5~0; {35318#true} is VALID [2020-07-11 01:01:19,742 INFO L280 TraceCheckUtils]: 24: Hoare triple {35318#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,743 INFO L280 TraceCheckUtils]: 25: Hoare triple {35318#true} ~p6~0 := #t~nondet5; {35318#true} is VALID [2020-07-11 01:01:19,743 INFO L280 TraceCheckUtils]: 26: Hoare triple {35318#true} havoc #t~nondet5; {35318#true} is VALID [2020-07-11 01:01:19,743 INFO L280 TraceCheckUtils]: 27: Hoare triple {35318#true} havoc ~lk6~0; {35318#true} is VALID [2020-07-11 01:01:19,744 INFO L280 TraceCheckUtils]: 28: Hoare triple {35318#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,744 INFO L280 TraceCheckUtils]: 29: Hoare triple {35318#true} ~p7~0 := #t~nondet6; {35318#true} is VALID [2020-07-11 01:01:19,744 INFO L280 TraceCheckUtils]: 30: Hoare triple {35318#true} havoc #t~nondet6; {35318#true} is VALID [2020-07-11 01:01:19,744 INFO L280 TraceCheckUtils]: 31: Hoare triple {35318#true} havoc ~lk7~0; {35318#true} is VALID [2020-07-11 01:01:19,745 INFO L280 TraceCheckUtils]: 32: Hoare triple {35318#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,745 INFO L280 TraceCheckUtils]: 33: Hoare triple {35318#true} ~p8~0 := #t~nondet7; {35318#true} is VALID [2020-07-11 01:01:19,745 INFO L280 TraceCheckUtils]: 34: Hoare triple {35318#true} havoc #t~nondet7; {35318#true} is VALID [2020-07-11 01:01:19,745 INFO L280 TraceCheckUtils]: 35: Hoare triple {35318#true} havoc ~lk8~0; {35318#true} is VALID [2020-07-11 01:01:19,745 INFO L280 TraceCheckUtils]: 36: Hoare triple {35318#true} havoc ~cond~0; {35318#true} is VALID [2020-07-11 01:01:19,746 INFO L280 TraceCheckUtils]: 37: Hoare triple {35318#true} assume !false; {35318#true} is VALID [2020-07-11 01:01:19,746 INFO L280 TraceCheckUtils]: 38: Hoare triple {35318#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {35318#true} is VALID [2020-07-11 01:01:19,746 INFO L280 TraceCheckUtils]: 39: Hoare triple {35318#true} ~cond~0 := #t~nondet8; {35318#true} is VALID [2020-07-11 01:01:19,746 INFO L280 TraceCheckUtils]: 40: Hoare triple {35318#true} havoc #t~nondet8; {35318#true} is VALID [2020-07-11 01:01:19,746 INFO L280 TraceCheckUtils]: 41: Hoare triple {35318#true} assume !(0 == ~cond~0); {35318#true} is VALID [2020-07-11 01:01:19,746 INFO L280 TraceCheckUtils]: 42: Hoare triple {35318#true} ~lk1~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,747 INFO L280 TraceCheckUtils]: 43: Hoare triple {35318#true} ~lk2~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,747 INFO L280 TraceCheckUtils]: 44: Hoare triple {35318#true} ~lk3~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,747 INFO L280 TraceCheckUtils]: 45: Hoare triple {35318#true} ~lk4~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,747 INFO L280 TraceCheckUtils]: 46: Hoare triple {35318#true} ~lk5~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,747 INFO L280 TraceCheckUtils]: 47: Hoare triple {35318#true} ~lk6~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,748 INFO L280 TraceCheckUtils]: 48: Hoare triple {35318#true} ~lk7~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,748 INFO L280 TraceCheckUtils]: 49: Hoare triple {35318#true} ~lk8~0 := 0; {35318#true} is VALID [2020-07-11 01:01:19,748 INFO L280 TraceCheckUtils]: 50: Hoare triple {35318#true} assume !(0 != ~p1~0); {35318#true} is VALID [2020-07-11 01:01:19,748 INFO L280 TraceCheckUtils]: 51: Hoare triple {35318#true} assume !(0 != ~p2~0); {35318#true} is VALID [2020-07-11 01:01:19,748 INFO L280 TraceCheckUtils]: 52: Hoare triple {35318#true} assume !(0 != ~p3~0); {35318#true} is VALID [2020-07-11 01:01:19,748 INFO L280 TraceCheckUtils]: 53: Hoare triple {35318#true} assume !(0 != ~p4~0); {35318#true} is VALID [2020-07-11 01:01:19,749 INFO L280 TraceCheckUtils]: 54: Hoare triple {35318#true} assume 0 != ~p5~0; {35318#true} is VALID [2020-07-11 01:01:19,751 INFO L280 TraceCheckUtils]: 55: Hoare triple {35318#true} ~lk5~0 := 1; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,751 INFO L280 TraceCheckUtils]: 56: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,752 INFO L280 TraceCheckUtils]: 57: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,752 INFO L280 TraceCheckUtils]: 58: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,753 INFO L280 TraceCheckUtils]: 59: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,753 INFO L280 TraceCheckUtils]: 60: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,753 INFO L280 TraceCheckUtils]: 61: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,754 INFO L280 TraceCheckUtils]: 62: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,754 INFO L280 TraceCheckUtils]: 63: Hoare triple {35322#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:01:19,755 INFO L280 TraceCheckUtils]: 64: Hoare triple {35322#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {35319#false} is VALID [2020-07-11 01:01:19,755 INFO L280 TraceCheckUtils]: 65: Hoare triple {35319#false} assume !false; {35319#false} is VALID [2020-07-11 01:01:19,759 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-11 01:01:19,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038733328] [2020-07-11 01:01:19,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:19,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:19,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019048291] [2020-07-11 01:01:19,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-11 01:01:19,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:19,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:19,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:19,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:19,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:19,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:19,817 INFO L87 Difference]: Start difference. First operand 1495 states and 1958 transitions. Second operand 3 states. [2020-07-11 01:01:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:23,964 INFO L93 Difference]: Finished difference Result 1803 states and 2360 transitions. [2020-07-11 01:01:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:01:23,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-11 01:01:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:01:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-11 01:01:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-11 01:01:23,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2020-07-11 01:01:24,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:24,230 INFO L225 Difference]: With dead ends: 1803 [2020-07-11 01:01:24,230 INFO L226 Difference]: Without dead ends: 1801 [2020-07-11 01:01:24,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:01:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2020-07-11 01:01:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1495. [2020-07-11 01:01:27,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:27,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1801 states. Second operand 1495 states. [2020-07-11 01:01:27,421 INFO L74 IsIncluded]: Start isIncluded. First operand 1801 states. Second operand 1495 states. [2020-07-11 01:01:27,421 INFO L87 Difference]: Start difference. First operand 1801 states. Second operand 1495 states. [2020-07-11 01:01:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:27,525 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-11 01:01:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-11 01:01:27,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:27,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:27,527 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1801 states. [2020-07-11 01:01:27,527 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1801 states. [2020-07-11 01:01:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:27,645 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-11 01:01:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-11 01:01:27,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:27,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:27,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:27,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-11 01:01:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1942 transitions. [2020-07-11 01:01:27,719 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1942 transitions. Word has length 66 [2020-07-11 01:01:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:27,719 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1942 transitions. [2020-07-11 01:01:27,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:27,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1942 transitions. [2020-07-11 01:01:30,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1942 edges. 1942 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1942 transitions. [2020-07-11 01:01:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-11 01:01:30,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:30,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:01:30,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 01:01:30,228 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -678433246, now seen corresponding path program 1 times [2020-07-11 01:01:30,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:30,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [325307385] [2020-07-11 01:01:30,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:30,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-11 01:01:30,275 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-11 01:01:30,275 INFO L263 TraceCheckUtils]: 0: Hoare triple {45523#true} call ULTIMATE.init(); {45523#true} is VALID [2020-07-11 01:01:30,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-11 01:01:30,275 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-11 01:01:30,276 INFO L263 TraceCheckUtils]: 3: Hoare triple {45523#true} call #t~ret9 := main(); {45523#true} is VALID [2020-07-11 01:01:30,276 INFO L280 TraceCheckUtils]: 4: Hoare triple {45523#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {45523#true} ~p1~0 := #t~nondet0; {45523#true} is VALID [2020-07-11 01:01:30,276 INFO L280 TraceCheckUtils]: 6: Hoare triple {45523#true} havoc #t~nondet0; {45523#true} is VALID [2020-07-11 01:01:30,276 INFO L280 TraceCheckUtils]: 7: Hoare triple {45523#true} havoc ~lk1~0; {45523#true} is VALID [2020-07-11 01:01:30,276 INFO L280 TraceCheckUtils]: 8: Hoare triple {45523#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,277 INFO L280 TraceCheckUtils]: 9: Hoare triple {45523#true} ~p2~0 := #t~nondet1; {45523#true} is VALID [2020-07-11 01:01:30,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {45523#true} havoc #t~nondet1; {45523#true} is VALID [2020-07-11 01:01:30,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {45523#true} havoc ~lk2~0; {45523#true} is VALID [2020-07-11 01:01:30,277 INFO L280 TraceCheckUtils]: 12: Hoare triple {45523#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,277 INFO L280 TraceCheckUtils]: 13: Hoare triple {45523#true} ~p3~0 := #t~nondet2; {45523#true} is VALID [2020-07-11 01:01:30,278 INFO L280 TraceCheckUtils]: 14: Hoare triple {45523#true} havoc #t~nondet2; {45523#true} is VALID [2020-07-11 01:01:30,278 INFO L280 TraceCheckUtils]: 15: Hoare triple {45523#true} havoc ~lk3~0; {45523#true} is VALID [2020-07-11 01:01:30,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {45523#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,278 INFO L280 TraceCheckUtils]: 17: Hoare triple {45523#true} ~p4~0 := #t~nondet3; {45523#true} is VALID [2020-07-11 01:01:30,278 INFO L280 TraceCheckUtils]: 18: Hoare triple {45523#true} havoc #t~nondet3; {45523#true} is VALID [2020-07-11 01:01:30,278 INFO L280 TraceCheckUtils]: 19: Hoare triple {45523#true} havoc ~lk4~0; {45523#true} is VALID [2020-07-11 01:01:30,279 INFO L280 TraceCheckUtils]: 20: Hoare triple {45523#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,279 INFO L280 TraceCheckUtils]: 21: Hoare triple {45523#true} ~p5~0 := #t~nondet4; {45523#true} is VALID [2020-07-11 01:01:30,279 INFO L280 TraceCheckUtils]: 22: Hoare triple {45523#true} havoc #t~nondet4; {45523#true} is VALID [2020-07-11 01:01:30,279 INFO L280 TraceCheckUtils]: 23: Hoare triple {45523#true} havoc ~lk5~0; {45523#true} is VALID [2020-07-11 01:01:30,279 INFO L280 TraceCheckUtils]: 24: Hoare triple {45523#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,279 INFO L280 TraceCheckUtils]: 25: Hoare triple {45523#true} ~p6~0 := #t~nondet5; {45523#true} is VALID [2020-07-11 01:01:30,280 INFO L280 TraceCheckUtils]: 26: Hoare triple {45523#true} havoc #t~nondet5; {45523#true} is VALID [2020-07-11 01:01:30,280 INFO L280 TraceCheckUtils]: 27: Hoare triple {45523#true} havoc ~lk6~0; {45523#true} is VALID [2020-07-11 01:01:30,280 INFO L280 TraceCheckUtils]: 28: Hoare triple {45523#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,280 INFO L280 TraceCheckUtils]: 29: Hoare triple {45523#true} ~p7~0 := #t~nondet6; {45523#true} is VALID [2020-07-11 01:01:30,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {45523#true} havoc #t~nondet6; {45523#true} is VALID [2020-07-11 01:01:30,280 INFO L280 TraceCheckUtils]: 31: Hoare triple {45523#true} havoc ~lk7~0; {45523#true} is VALID [2020-07-11 01:01:30,281 INFO L280 TraceCheckUtils]: 32: Hoare triple {45523#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,281 INFO L280 TraceCheckUtils]: 33: Hoare triple {45523#true} ~p8~0 := #t~nondet7; {45523#true} is VALID [2020-07-11 01:01:30,281 INFO L280 TraceCheckUtils]: 34: Hoare triple {45523#true} havoc #t~nondet7; {45523#true} is VALID [2020-07-11 01:01:30,281 INFO L280 TraceCheckUtils]: 35: Hoare triple {45523#true} havoc ~lk8~0; {45523#true} is VALID [2020-07-11 01:01:30,281 INFO L280 TraceCheckUtils]: 36: Hoare triple {45523#true} havoc ~cond~0; {45523#true} is VALID [2020-07-11 01:01:30,282 INFO L280 TraceCheckUtils]: 37: Hoare triple {45523#true} assume !false; {45523#true} is VALID [2020-07-11 01:01:30,282 INFO L280 TraceCheckUtils]: 38: Hoare triple {45523#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {45523#true} is VALID [2020-07-11 01:01:30,282 INFO L280 TraceCheckUtils]: 39: Hoare triple {45523#true} ~cond~0 := #t~nondet8; {45523#true} is VALID [2020-07-11 01:01:30,282 INFO L280 TraceCheckUtils]: 40: Hoare triple {45523#true} havoc #t~nondet8; {45523#true} is VALID [2020-07-11 01:01:30,282 INFO L280 TraceCheckUtils]: 41: Hoare triple {45523#true} assume !(0 == ~cond~0); {45523#true} is VALID [2020-07-11 01:01:30,282 INFO L280 TraceCheckUtils]: 42: Hoare triple {45523#true} ~lk1~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,283 INFO L280 TraceCheckUtils]: 43: Hoare triple {45523#true} ~lk2~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,283 INFO L280 TraceCheckUtils]: 44: Hoare triple {45523#true} ~lk3~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,283 INFO L280 TraceCheckUtils]: 45: Hoare triple {45523#true} ~lk4~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,283 INFO L280 TraceCheckUtils]: 46: Hoare triple {45523#true} ~lk5~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,283 INFO L280 TraceCheckUtils]: 47: Hoare triple {45523#true} ~lk6~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,283 INFO L280 TraceCheckUtils]: 48: Hoare triple {45523#true} ~lk7~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,284 INFO L280 TraceCheckUtils]: 49: Hoare triple {45523#true} ~lk8~0 := 0; {45523#true} is VALID [2020-07-11 01:01:30,284 INFO L280 TraceCheckUtils]: 50: Hoare triple {45523#true} assume !(0 != ~p1~0); {45523#true} is VALID [2020-07-11 01:01:30,284 INFO L280 TraceCheckUtils]: 51: Hoare triple {45523#true} assume !(0 != ~p2~0); {45523#true} is VALID [2020-07-11 01:01:30,284 INFO L280 TraceCheckUtils]: 52: Hoare triple {45523#true} assume !(0 != ~p3~0); {45523#true} is VALID [2020-07-11 01:01:30,284 INFO L280 TraceCheckUtils]: 53: Hoare triple {45523#true} assume !(0 != ~p4~0); {45523#true} is VALID [2020-07-11 01:01:30,284 INFO L280 TraceCheckUtils]: 54: Hoare triple {45523#true} assume !(0 != ~p5~0); {45523#true} is VALID [2020-07-11 01:01:30,288 INFO L280 TraceCheckUtils]: 55: Hoare triple {45523#true} assume !(0 != ~p6~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,289 INFO L280 TraceCheckUtils]: 56: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,294 INFO L280 TraceCheckUtils]: 57: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,296 INFO L280 TraceCheckUtils]: 58: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,297 INFO L280 TraceCheckUtils]: 59: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,298 INFO L280 TraceCheckUtils]: 60: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,298 INFO L280 TraceCheckUtils]: 61: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,299 INFO L280 TraceCheckUtils]: 62: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:30,299 INFO L280 TraceCheckUtils]: 63: Hoare triple {45527#(= 0 main_~p6~0)} assume 0 != ~p6~0; {45524#false} is VALID [2020-07-11 01:01:30,299 INFO L280 TraceCheckUtils]: 64: Hoare triple {45524#false} assume 1 != ~lk6~0; {45524#false} is VALID [2020-07-11 01:01:30,300 INFO L280 TraceCheckUtils]: 65: Hoare triple {45524#false} assume !false; {45524#false} is VALID [2020-07-11 01:01:30,302 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-11 01:01:30,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [325307385] [2020-07-11 01:01:30,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:30,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:30,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611468269] [2020-07-11 01:01:30,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-11 01:01:30,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:30,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:30,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:30,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:30,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:30,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:30,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:30,362 INFO L87 Difference]: Start difference. First operand 1495 states and 1942 transitions. Second operand 3 states. [2020-07-11 01:01:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:38,709 INFO L93 Difference]: Finished difference Result 4315 states and 5624 transitions. [2020-07-11 01:01:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:01:38,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-11 01:01:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:01:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-11 01:01:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-11 01:01:38,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2020-07-11 01:01:38,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:39,226 INFO L225 Difference]: With dead ends: 4315 [2020-07-11 01:01:39,226 INFO L226 Difference]: Without dead ends: 2857 [2020-07-11 01:01:39,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:01:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-07-11 01:01:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2020-07-11 01:01:46,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:46,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2857 states. Second operand 2855 states. [2020-07-11 01:01:46,175 INFO L74 IsIncluded]: Start isIncluded. First operand 2857 states. Second operand 2855 states. [2020-07-11 01:01:46,175 INFO L87 Difference]: Start difference. First operand 2857 states. Second operand 2855 states. [2020-07-11 01:01:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:46,398 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-11 01:01:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-11 01:01:46,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:46,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:46,403 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 2857 states. [2020-07-11 01:01:46,403 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 2857 states. [2020-07-11 01:01:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:46,635 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-11 01:01:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-11 01:01:46,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:46,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:46,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:46,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-11 01:01:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3654 transitions. [2020-07-11 01:01:46,888 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3654 transitions. Word has length 66 [2020-07-11 01:01:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:46,888 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3654 transitions. [2020-07-11 01:01:46,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:46,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3654 transitions. [2020-07-11 01:01:51,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3654 edges. 3654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3654 transitions. [2020-07-11 01:01:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-11 01:01:51,719 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:51,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:01:51,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 01:01:51,720 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1214689743, now seen corresponding path program 1 times [2020-07-11 01:01:51,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:51,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [483491824] [2020-07-11 01:01:51,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:51,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-11 01:01:51,774 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-11 01:01:51,774 INFO L263 TraceCheckUtils]: 0: Hoare triple {65584#true} call ULTIMATE.init(); {65584#true} is VALID [2020-07-11 01:01:51,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-11 01:01:51,775 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-11 01:01:51,775 INFO L263 TraceCheckUtils]: 3: Hoare triple {65584#true} call #t~ret9 := main(); {65584#true} is VALID [2020-07-11 01:01:51,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {65584#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {65584#true} ~p1~0 := #t~nondet0; {65584#true} is VALID [2020-07-11 01:01:51,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {65584#true} havoc #t~nondet0; {65584#true} is VALID [2020-07-11 01:01:51,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {65584#true} havoc ~lk1~0; {65584#true} is VALID [2020-07-11 01:01:51,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {65584#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {65584#true} ~p2~0 := #t~nondet1; {65584#true} is VALID [2020-07-11 01:01:51,776 INFO L280 TraceCheckUtils]: 10: Hoare triple {65584#true} havoc #t~nondet1; {65584#true} is VALID [2020-07-11 01:01:51,776 INFO L280 TraceCheckUtils]: 11: Hoare triple {65584#true} havoc ~lk2~0; {65584#true} is VALID [2020-07-11 01:01:51,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {65584#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {65584#true} ~p3~0 := #t~nondet2; {65584#true} is VALID [2020-07-11 01:01:51,777 INFO L280 TraceCheckUtils]: 14: Hoare triple {65584#true} havoc #t~nondet2; {65584#true} is VALID [2020-07-11 01:01:51,777 INFO L280 TraceCheckUtils]: 15: Hoare triple {65584#true} havoc ~lk3~0; {65584#true} is VALID [2020-07-11 01:01:51,777 INFO L280 TraceCheckUtils]: 16: Hoare triple {65584#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,777 INFO L280 TraceCheckUtils]: 17: Hoare triple {65584#true} ~p4~0 := #t~nondet3; {65584#true} is VALID [2020-07-11 01:01:51,777 INFO L280 TraceCheckUtils]: 18: Hoare triple {65584#true} havoc #t~nondet3; {65584#true} is VALID [2020-07-11 01:01:51,778 INFO L280 TraceCheckUtils]: 19: Hoare triple {65584#true} havoc ~lk4~0; {65584#true} is VALID [2020-07-11 01:01:51,778 INFO L280 TraceCheckUtils]: 20: Hoare triple {65584#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,778 INFO L280 TraceCheckUtils]: 21: Hoare triple {65584#true} ~p5~0 := #t~nondet4; {65584#true} is VALID [2020-07-11 01:01:51,778 INFO L280 TraceCheckUtils]: 22: Hoare triple {65584#true} havoc #t~nondet4; {65584#true} is VALID [2020-07-11 01:01:51,778 INFO L280 TraceCheckUtils]: 23: Hoare triple {65584#true} havoc ~lk5~0; {65584#true} is VALID [2020-07-11 01:01:51,778 INFO L280 TraceCheckUtils]: 24: Hoare triple {65584#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,779 INFO L280 TraceCheckUtils]: 25: Hoare triple {65584#true} ~p6~0 := #t~nondet5; {65584#true} is VALID [2020-07-11 01:01:51,779 INFO L280 TraceCheckUtils]: 26: Hoare triple {65584#true} havoc #t~nondet5; {65584#true} is VALID [2020-07-11 01:01:51,779 INFO L280 TraceCheckUtils]: 27: Hoare triple {65584#true} havoc ~lk6~0; {65584#true} is VALID [2020-07-11 01:01:51,779 INFO L280 TraceCheckUtils]: 28: Hoare triple {65584#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,779 INFO L280 TraceCheckUtils]: 29: Hoare triple {65584#true} ~p7~0 := #t~nondet6; {65584#true} is VALID [2020-07-11 01:01:51,780 INFO L280 TraceCheckUtils]: 30: Hoare triple {65584#true} havoc #t~nondet6; {65584#true} is VALID [2020-07-11 01:01:51,780 INFO L280 TraceCheckUtils]: 31: Hoare triple {65584#true} havoc ~lk7~0; {65584#true} is VALID [2020-07-11 01:01:51,780 INFO L280 TraceCheckUtils]: 32: Hoare triple {65584#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,780 INFO L280 TraceCheckUtils]: 33: Hoare triple {65584#true} ~p8~0 := #t~nondet7; {65584#true} is VALID [2020-07-11 01:01:51,780 INFO L280 TraceCheckUtils]: 34: Hoare triple {65584#true} havoc #t~nondet7; {65584#true} is VALID [2020-07-11 01:01:51,780 INFO L280 TraceCheckUtils]: 35: Hoare triple {65584#true} havoc ~lk8~0; {65584#true} is VALID [2020-07-11 01:01:51,781 INFO L280 TraceCheckUtils]: 36: Hoare triple {65584#true} havoc ~cond~0; {65584#true} is VALID [2020-07-11 01:01:51,781 INFO L280 TraceCheckUtils]: 37: Hoare triple {65584#true} assume !false; {65584#true} is VALID [2020-07-11 01:01:51,781 INFO L280 TraceCheckUtils]: 38: Hoare triple {65584#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {65584#true} is VALID [2020-07-11 01:01:51,781 INFO L280 TraceCheckUtils]: 39: Hoare triple {65584#true} ~cond~0 := #t~nondet8; {65584#true} is VALID [2020-07-11 01:01:51,781 INFO L280 TraceCheckUtils]: 40: Hoare triple {65584#true} havoc #t~nondet8; {65584#true} is VALID [2020-07-11 01:01:51,781 INFO L280 TraceCheckUtils]: 41: Hoare triple {65584#true} assume !(0 == ~cond~0); {65584#true} is VALID [2020-07-11 01:01:51,782 INFO L280 TraceCheckUtils]: 42: Hoare triple {65584#true} ~lk1~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,782 INFO L280 TraceCheckUtils]: 43: Hoare triple {65584#true} ~lk2~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,782 INFO L280 TraceCheckUtils]: 44: Hoare triple {65584#true} ~lk3~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,782 INFO L280 TraceCheckUtils]: 45: Hoare triple {65584#true} ~lk4~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,782 INFO L280 TraceCheckUtils]: 46: Hoare triple {65584#true} ~lk5~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,783 INFO L280 TraceCheckUtils]: 47: Hoare triple {65584#true} ~lk6~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,783 INFO L280 TraceCheckUtils]: 48: Hoare triple {65584#true} ~lk7~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,783 INFO L280 TraceCheckUtils]: 49: Hoare triple {65584#true} ~lk8~0 := 0; {65584#true} is VALID [2020-07-11 01:01:51,783 INFO L280 TraceCheckUtils]: 50: Hoare triple {65584#true} assume !(0 != ~p1~0); {65584#true} is VALID [2020-07-11 01:01:51,783 INFO L280 TraceCheckUtils]: 51: Hoare triple {65584#true} assume !(0 != ~p2~0); {65584#true} is VALID [2020-07-11 01:01:51,783 INFO L280 TraceCheckUtils]: 52: Hoare triple {65584#true} assume !(0 != ~p3~0); {65584#true} is VALID [2020-07-11 01:01:51,784 INFO L280 TraceCheckUtils]: 53: Hoare triple {65584#true} assume !(0 != ~p4~0); {65584#true} is VALID [2020-07-11 01:01:51,784 INFO L280 TraceCheckUtils]: 54: Hoare triple {65584#true} assume !(0 != ~p5~0); {65584#true} is VALID [2020-07-11 01:01:51,784 INFO L280 TraceCheckUtils]: 55: Hoare triple {65584#true} assume 0 != ~p6~0; {65584#true} is VALID [2020-07-11 01:01:51,793 INFO L280 TraceCheckUtils]: 56: Hoare triple {65584#true} ~lk6~0 := 1; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,794 INFO L280 TraceCheckUtils]: 57: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,795 INFO L280 TraceCheckUtils]: 58: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,795 INFO L280 TraceCheckUtils]: 59: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,796 INFO L280 TraceCheckUtils]: 60: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,796 INFO L280 TraceCheckUtils]: 61: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,796 INFO L280 TraceCheckUtils]: 62: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,797 INFO L280 TraceCheckUtils]: 63: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,797 INFO L280 TraceCheckUtils]: 64: Hoare triple {65588#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:51,798 INFO L280 TraceCheckUtils]: 65: Hoare triple {65588#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {65585#false} is VALID [2020-07-11 01:01:51,798 INFO L280 TraceCheckUtils]: 66: Hoare triple {65585#false} assume !false; {65585#false} is VALID [2020-07-11 01:01:51,801 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-11 01:01:51,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [483491824] [2020-07-11 01:01:51,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:51,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:51,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957824275] [2020-07-11 01:01:51,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-11 01:01:51,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:51,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:51,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:51,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:51,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:51,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:51,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:51,862 INFO L87 Difference]: Start difference. First operand 2855 states and 3654 transitions. Second operand 3 states. [2020-07-11 01:02:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:01,592 INFO L93 Difference]: Finished difference Result 3403 states and 4328 transitions. [2020-07-11 01:02:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:02:01,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-11 01:02:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-11 01:02:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-11 01:02:01,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2020-07-11 01:02:01,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:02,166 INFO L225 Difference]: With dead ends: 3403 [2020-07-11 01:02:02,166 INFO L226 Difference]: Without dead ends: 3401 [2020-07-11 01:02:02,168 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:02:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-07-11 01:02:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2855. [2020-07-11 01:02:09,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:09,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3401 states. Second operand 2855 states. [2020-07-11 01:02:09,890 INFO L74 IsIncluded]: Start isIncluded. First operand 3401 states. Second operand 2855 states. [2020-07-11 01:02:09,891 INFO L87 Difference]: Start difference. First operand 3401 states. Second operand 2855 states. [2020-07-11 01:02:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:10,248 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-11 01:02:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-11 01:02:10,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:10,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:10,252 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 3401 states. [2020-07-11 01:02:10,252 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 3401 states. [2020-07-11 01:02:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:10,606 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-11 01:02:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-11 01:02:10,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:10,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:10,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:10,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-11 01:02:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3622 transitions. [2020-07-11 01:02:10,856 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3622 transitions. Word has length 67 [2020-07-11 01:02:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:10,856 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3622 transitions. [2020-07-11 01:02:10,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:02:10,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3622 transitions. [2020-07-11 01:02:15,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3622 edges. 3622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3622 transitions. [2020-07-11 01:02:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-11 01:02:15,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:15,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:02:15,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 01:02:15,771 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash 443652336, now seen corresponding path program 1 times [2020-07-11 01:02:15,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:15,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093466201] [2020-07-11 01:02:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:15,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-11 01:02:15,811 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-11 01:02:15,811 INFO L263 TraceCheckUtils]: 0: Hoare triple {84909#true} call ULTIMATE.init(); {84909#true} is VALID [2020-07-11 01:02:15,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-11 01:02:15,812 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-11 01:02:15,812 INFO L263 TraceCheckUtils]: 3: Hoare triple {84909#true} call #t~ret9 := main(); {84909#true} is VALID [2020-07-11 01:02:15,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {84909#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {84909#true} ~p1~0 := #t~nondet0; {84909#true} is VALID [2020-07-11 01:02:15,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {84909#true} havoc #t~nondet0; {84909#true} is VALID [2020-07-11 01:02:15,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {84909#true} havoc ~lk1~0; {84909#true} is VALID [2020-07-11 01:02:15,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {84909#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {84909#true} ~p2~0 := #t~nondet1; {84909#true} is VALID [2020-07-11 01:02:15,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {84909#true} havoc #t~nondet1; {84909#true} is VALID [2020-07-11 01:02:15,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {84909#true} havoc ~lk2~0; {84909#true} is VALID [2020-07-11 01:02:15,813 INFO L280 TraceCheckUtils]: 12: Hoare triple {84909#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {84909#true} ~p3~0 := #t~nondet2; {84909#true} is VALID [2020-07-11 01:02:15,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {84909#true} havoc #t~nondet2; {84909#true} is VALID [2020-07-11 01:02:15,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {84909#true} havoc ~lk3~0; {84909#true} is VALID [2020-07-11 01:02:15,814 INFO L280 TraceCheckUtils]: 16: Hoare triple {84909#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,814 INFO L280 TraceCheckUtils]: 17: Hoare triple {84909#true} ~p4~0 := #t~nondet3; {84909#true} is VALID [2020-07-11 01:02:15,814 INFO L280 TraceCheckUtils]: 18: Hoare triple {84909#true} havoc #t~nondet3; {84909#true} is VALID [2020-07-11 01:02:15,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {84909#true} havoc ~lk4~0; {84909#true} is VALID [2020-07-11 01:02:15,815 INFO L280 TraceCheckUtils]: 20: Hoare triple {84909#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,815 INFO L280 TraceCheckUtils]: 21: Hoare triple {84909#true} ~p5~0 := #t~nondet4; {84909#true} is VALID [2020-07-11 01:02:15,815 INFO L280 TraceCheckUtils]: 22: Hoare triple {84909#true} havoc #t~nondet4; {84909#true} is VALID [2020-07-11 01:02:15,815 INFO L280 TraceCheckUtils]: 23: Hoare triple {84909#true} havoc ~lk5~0; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 24: Hoare triple {84909#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 25: Hoare triple {84909#true} ~p6~0 := #t~nondet5; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 26: Hoare triple {84909#true} havoc #t~nondet5; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 27: Hoare triple {84909#true} havoc ~lk6~0; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 28: Hoare triple {84909#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 29: Hoare triple {84909#true} ~p7~0 := #t~nondet6; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 30: Hoare triple {84909#true} havoc #t~nondet6; {84909#true} is VALID [2020-07-11 01:02:15,816 INFO L280 TraceCheckUtils]: 31: Hoare triple {84909#true} havoc ~lk7~0; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 32: Hoare triple {84909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 33: Hoare triple {84909#true} ~p8~0 := #t~nondet7; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 34: Hoare triple {84909#true} havoc #t~nondet7; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 35: Hoare triple {84909#true} havoc ~lk8~0; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 36: Hoare triple {84909#true} havoc ~cond~0; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 37: Hoare triple {84909#true} assume !false; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 38: Hoare triple {84909#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {84909#true} is VALID [2020-07-11 01:02:15,817 INFO L280 TraceCheckUtils]: 39: Hoare triple {84909#true} ~cond~0 := #t~nondet8; {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 40: Hoare triple {84909#true} havoc #t~nondet8; {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 41: Hoare triple {84909#true} assume !(0 == ~cond~0); {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 42: Hoare triple {84909#true} ~lk1~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 43: Hoare triple {84909#true} ~lk2~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 44: Hoare triple {84909#true} ~lk3~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 45: Hoare triple {84909#true} ~lk4~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 46: Hoare triple {84909#true} ~lk5~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,818 INFO L280 TraceCheckUtils]: 47: Hoare triple {84909#true} ~lk6~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 48: Hoare triple {84909#true} ~lk7~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 49: Hoare triple {84909#true} ~lk8~0 := 0; {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 50: Hoare triple {84909#true} assume !(0 != ~p1~0); {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 51: Hoare triple {84909#true} assume !(0 != ~p2~0); {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 52: Hoare triple {84909#true} assume !(0 != ~p3~0); {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 53: Hoare triple {84909#true} assume !(0 != ~p4~0); {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 54: Hoare triple {84909#true} assume !(0 != ~p5~0); {84909#true} is VALID [2020-07-11 01:02:15,819 INFO L280 TraceCheckUtils]: 55: Hoare triple {84909#true} assume !(0 != ~p6~0); {84909#true} is VALID [2020-07-11 01:02:15,820 INFO L280 TraceCheckUtils]: 56: Hoare triple {84909#true} assume !(0 != ~p7~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,820 INFO L280 TraceCheckUtils]: 57: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,821 INFO L280 TraceCheckUtils]: 58: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,821 INFO L280 TraceCheckUtils]: 59: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,821 INFO L280 TraceCheckUtils]: 60: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,822 INFO L280 TraceCheckUtils]: 61: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,822 INFO L280 TraceCheckUtils]: 62: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,822 INFO L280 TraceCheckUtils]: 63: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-11 01:02:15,823 INFO L280 TraceCheckUtils]: 64: Hoare triple {84913#(= 0 main_~p7~0)} assume 0 != ~p7~0; {84910#false} is VALID [2020-07-11 01:02:15,823 INFO L280 TraceCheckUtils]: 65: Hoare triple {84910#false} assume 1 != ~lk7~0; {84910#false} is VALID [2020-07-11 01:02:15,823 INFO L280 TraceCheckUtils]: 66: Hoare triple {84910#false} assume !false; {84910#false} is VALID [2020-07-11 01:02:15,825 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-11 01:02:15,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2093466201] [2020-07-11 01:02:15,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:15,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:02:15,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796130292] [2020-07-11 01:02:15,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-11 01:02:15,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:15,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:02:15,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:15,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:02:15,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:15,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:02:15,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:02:15,891 INFO L87 Difference]: Start difference. First operand 2855 states and 3622 transitions. Second operand 3 states. [2020-07-11 01:02:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:35,143 INFO L93 Difference]: Finished difference Result 8299 states and 10536 transitions. [2020-07-11 01:02:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:02:35,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-11 01:02:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-11 01:02:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-11 01:02:35,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2020-07-11 01:02:35,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:36,423 INFO L225 Difference]: With dead ends: 8299 [2020-07-11 01:02:36,424 INFO L226 Difference]: Without dead ends: 5481 [2020-07-11 01:02:36,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:02:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2020-07-11 01:02:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5479. [2020-07-11 01:02:52,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:52,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5481 states. Second operand 5479 states. [2020-07-11 01:02:52,076 INFO L74 IsIncluded]: Start isIncluded. First operand 5481 states. Second operand 5479 states. [2020-07-11 01:02:52,076 INFO L87 Difference]: Start difference. First operand 5481 states. Second operand 5479 states. [2020-07-11 01:02:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:53,124 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-11 01:02:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-11 01:02:53,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:53,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:53,131 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5481 states. [2020-07-11 01:02:53,132 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5481 states. [2020-07-11 01:02:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:54,269 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-11 01:02:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-11 01:02:54,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:54,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:54,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:54,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-11 01:02:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6822 transitions. [2020-07-11 01:02:55,784 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6822 transitions. Word has length 67 [2020-07-11 01:02:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:55,784 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6822 transitions. [2020-07-11 01:02:55,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:02:55,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6822 transitions. [2020-07-11 01:03:05,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6822 edges. 6822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6822 transitions. [2020-07-11 01:03:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-11 01:03:05,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:05,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:05,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 01:03:05,361 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash 192792828, now seen corresponding path program 1 times [2020-07-11 01:03:05,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:05,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999628164] [2020-07-11 01:03:05,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:05,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-11 01:03:05,402 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-11 01:03:05,402 INFO L263 TraceCheckUtils]: 0: Hoare triple {123434#true} call ULTIMATE.init(); {123434#true} is VALID [2020-07-11 01:03:05,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-11 01:03:05,403 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-11 01:03:05,403 INFO L263 TraceCheckUtils]: 3: Hoare triple {123434#true} call #t~ret9 := main(); {123434#true} is VALID [2020-07-11 01:03:05,403 INFO L280 TraceCheckUtils]: 4: Hoare triple {123434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,403 INFO L280 TraceCheckUtils]: 5: Hoare triple {123434#true} ~p1~0 := #t~nondet0; {123434#true} is VALID [2020-07-11 01:03:05,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {123434#true} havoc #t~nondet0; {123434#true} is VALID [2020-07-11 01:03:05,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {123434#true} havoc ~lk1~0; {123434#true} is VALID [2020-07-11 01:03:05,404 INFO L280 TraceCheckUtils]: 8: Hoare triple {123434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {123434#true} ~p2~0 := #t~nondet1; {123434#true} is VALID [2020-07-11 01:03:05,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {123434#true} havoc #t~nondet1; {123434#true} is VALID [2020-07-11 01:03:05,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {123434#true} havoc ~lk2~0; {123434#true} is VALID [2020-07-11 01:03:05,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {123434#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {123434#true} ~p3~0 := #t~nondet2; {123434#true} is VALID [2020-07-11 01:03:05,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {123434#true} havoc #t~nondet2; {123434#true} is VALID [2020-07-11 01:03:05,405 INFO L280 TraceCheckUtils]: 15: Hoare triple {123434#true} havoc ~lk3~0; {123434#true} is VALID [2020-07-11 01:03:05,405 INFO L280 TraceCheckUtils]: 16: Hoare triple {123434#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,405 INFO L280 TraceCheckUtils]: 17: Hoare triple {123434#true} ~p4~0 := #t~nondet3; {123434#true} is VALID [2020-07-11 01:03:05,406 INFO L280 TraceCheckUtils]: 18: Hoare triple {123434#true} havoc #t~nondet3; {123434#true} is VALID [2020-07-11 01:03:05,406 INFO L280 TraceCheckUtils]: 19: Hoare triple {123434#true} havoc ~lk4~0; {123434#true} is VALID [2020-07-11 01:03:05,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {123434#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,406 INFO L280 TraceCheckUtils]: 21: Hoare triple {123434#true} ~p5~0 := #t~nondet4; {123434#true} is VALID [2020-07-11 01:03:05,406 INFO L280 TraceCheckUtils]: 22: Hoare triple {123434#true} havoc #t~nondet4; {123434#true} is VALID [2020-07-11 01:03:05,406 INFO L280 TraceCheckUtils]: 23: Hoare triple {123434#true} havoc ~lk5~0; {123434#true} is VALID [2020-07-11 01:03:05,407 INFO L280 TraceCheckUtils]: 24: Hoare triple {123434#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,407 INFO L280 TraceCheckUtils]: 25: Hoare triple {123434#true} ~p6~0 := #t~nondet5; {123434#true} is VALID [2020-07-11 01:03:05,407 INFO L280 TraceCheckUtils]: 26: Hoare triple {123434#true} havoc #t~nondet5; {123434#true} is VALID [2020-07-11 01:03:05,407 INFO L280 TraceCheckUtils]: 27: Hoare triple {123434#true} havoc ~lk6~0; {123434#true} is VALID [2020-07-11 01:03:05,407 INFO L280 TraceCheckUtils]: 28: Hoare triple {123434#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,407 INFO L280 TraceCheckUtils]: 29: Hoare triple {123434#true} ~p7~0 := #t~nondet6; {123434#true} is VALID [2020-07-11 01:03:05,408 INFO L280 TraceCheckUtils]: 30: Hoare triple {123434#true} havoc #t~nondet6; {123434#true} is VALID [2020-07-11 01:03:05,408 INFO L280 TraceCheckUtils]: 31: Hoare triple {123434#true} havoc ~lk7~0; {123434#true} is VALID [2020-07-11 01:03:05,408 INFO L280 TraceCheckUtils]: 32: Hoare triple {123434#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,408 INFO L280 TraceCheckUtils]: 33: Hoare triple {123434#true} ~p8~0 := #t~nondet7; {123434#true} is VALID [2020-07-11 01:03:05,408 INFO L280 TraceCheckUtils]: 34: Hoare triple {123434#true} havoc #t~nondet7; {123434#true} is VALID [2020-07-11 01:03:05,408 INFO L280 TraceCheckUtils]: 35: Hoare triple {123434#true} havoc ~lk8~0; {123434#true} is VALID [2020-07-11 01:03:05,409 INFO L280 TraceCheckUtils]: 36: Hoare triple {123434#true} havoc ~cond~0; {123434#true} is VALID [2020-07-11 01:03:05,409 INFO L280 TraceCheckUtils]: 37: Hoare triple {123434#true} assume !false; {123434#true} is VALID [2020-07-11 01:03:05,409 INFO L280 TraceCheckUtils]: 38: Hoare triple {123434#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {123434#true} is VALID [2020-07-11 01:03:05,409 INFO L280 TraceCheckUtils]: 39: Hoare triple {123434#true} ~cond~0 := #t~nondet8; {123434#true} is VALID [2020-07-11 01:03:05,409 INFO L280 TraceCheckUtils]: 40: Hoare triple {123434#true} havoc #t~nondet8; {123434#true} is VALID [2020-07-11 01:03:05,410 INFO L280 TraceCheckUtils]: 41: Hoare triple {123434#true} assume !(0 == ~cond~0); {123434#true} is VALID [2020-07-11 01:03:05,410 INFO L280 TraceCheckUtils]: 42: Hoare triple {123434#true} ~lk1~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,410 INFO L280 TraceCheckUtils]: 43: Hoare triple {123434#true} ~lk2~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,410 INFO L280 TraceCheckUtils]: 44: Hoare triple {123434#true} ~lk3~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,410 INFO L280 TraceCheckUtils]: 45: Hoare triple {123434#true} ~lk4~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,410 INFO L280 TraceCheckUtils]: 46: Hoare triple {123434#true} ~lk5~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,411 INFO L280 TraceCheckUtils]: 47: Hoare triple {123434#true} ~lk6~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,411 INFO L280 TraceCheckUtils]: 48: Hoare triple {123434#true} ~lk7~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,411 INFO L280 TraceCheckUtils]: 49: Hoare triple {123434#true} ~lk8~0 := 0; {123434#true} is VALID [2020-07-11 01:03:05,411 INFO L280 TraceCheckUtils]: 50: Hoare triple {123434#true} assume !(0 != ~p1~0); {123434#true} is VALID [2020-07-11 01:03:05,411 INFO L280 TraceCheckUtils]: 51: Hoare triple {123434#true} assume !(0 != ~p2~0); {123434#true} is VALID [2020-07-11 01:03:05,411 INFO L280 TraceCheckUtils]: 52: Hoare triple {123434#true} assume !(0 != ~p3~0); {123434#true} is VALID [2020-07-11 01:03:05,412 INFO L280 TraceCheckUtils]: 53: Hoare triple {123434#true} assume !(0 != ~p4~0); {123434#true} is VALID [2020-07-11 01:03:05,412 INFO L280 TraceCheckUtils]: 54: Hoare triple {123434#true} assume !(0 != ~p5~0); {123434#true} is VALID [2020-07-11 01:03:05,412 INFO L280 TraceCheckUtils]: 55: Hoare triple {123434#true} assume !(0 != ~p6~0); {123434#true} is VALID [2020-07-11 01:03:05,412 INFO L280 TraceCheckUtils]: 56: Hoare triple {123434#true} assume 0 != ~p7~0; {123434#true} is VALID [2020-07-11 01:03:05,413 INFO L280 TraceCheckUtils]: 57: Hoare triple {123434#true} ~lk7~0 := 1; {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,413 INFO L280 TraceCheckUtils]: 58: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,414 INFO L280 TraceCheckUtils]: 59: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,414 INFO L280 TraceCheckUtils]: 60: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,415 INFO L280 TraceCheckUtils]: 61: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,415 INFO L280 TraceCheckUtils]: 62: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,416 INFO L280 TraceCheckUtils]: 63: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,416 INFO L280 TraceCheckUtils]: 64: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,416 INFO L280 TraceCheckUtils]: 65: Hoare triple {123438#(= main_~lk7~0 1)} assume 0 != ~p7~0; {123438#(= main_~lk7~0 1)} is VALID [2020-07-11 01:03:05,417 INFO L280 TraceCheckUtils]: 66: Hoare triple {123438#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {123435#false} is VALID [2020-07-11 01:03:05,417 INFO L280 TraceCheckUtils]: 67: Hoare triple {123435#false} assume !false; {123435#false} is VALID [2020-07-11 01:03:05,420 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-11 01:03:05,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999628164] [2020-07-11 01:03:05,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:05,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:03:05,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644405650] [2020-07-11 01:03:05,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-11 01:03:05,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:05,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:03:05,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:05,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:03:05,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:03:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:03:05,479 INFO L87 Difference]: Start difference. First operand 5479 states and 6822 transitions. Second operand 3 states. [2020-07-11 01:03:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:26,306 INFO L93 Difference]: Finished difference Result 6443 states and 7912 transitions. [2020-07-11 01:03:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:03:26,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-11 01:03:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-11 01:03:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-11 01:03:26,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-11 01:03:26,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:28,022 INFO L225 Difference]: With dead ends: 6443 [2020-07-11 01:03:28,022 INFO L226 Difference]: Without dead ends: 6441 [2020-07-11 01:03:28,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:03:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2020-07-11 01:03:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5479. [2020-07-11 01:03:44,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:44,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6441 states. Second operand 5479 states. [2020-07-11 01:03:44,667 INFO L74 IsIncluded]: Start isIncluded. First operand 6441 states. Second operand 5479 states. [2020-07-11 01:03:44,667 INFO L87 Difference]: Start difference. First operand 6441 states. Second operand 5479 states. [2020-07-11 01:03:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:46,063 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-11 01:03:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-11 01:03:46,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:46,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:46,070 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 6441 states. [2020-07-11 01:03:46,070 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 6441 states. [2020-07-11 01:03:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:47,474 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-11 01:03:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-11 01:03:47,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:47,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:47,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:47,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-11 01:03:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6758 transitions. [2020-07-11 01:03:48,503 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6758 transitions. Word has length 68 [2020-07-11 01:03:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:48,504 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6758 transitions. [2020-07-11 01:03:48,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:03:48,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6758 transitions. [2020-07-11 01:03:57,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6758 edges. 6758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6758 transitions. [2020-07-11 01:03:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-11 01:03:57,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:57,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:57,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-11 01:03:57,812 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 868567382, now seen corresponding path program 1 times [2020-07-11 01:03:57,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:57,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1818992100] [2020-07-11 01:03:57,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:57,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-11 01:03:57,845 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-11 01:03:57,846 INFO L263 TraceCheckUtils]: 0: Hoare triple {160167#true} call ULTIMATE.init(); {160167#true} is VALID [2020-07-11 01:03:57,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-11 01:03:57,846 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-11 01:03:57,846 INFO L263 TraceCheckUtils]: 3: Hoare triple {160167#true} call #t~ret9 := main(); {160167#true} is VALID [2020-07-11 01:03:57,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {160167#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,847 INFO L280 TraceCheckUtils]: 5: Hoare triple {160167#true} ~p1~0 := #t~nondet0; {160167#true} is VALID [2020-07-11 01:03:57,847 INFO L280 TraceCheckUtils]: 6: Hoare triple {160167#true} havoc #t~nondet0; {160167#true} is VALID [2020-07-11 01:03:57,847 INFO L280 TraceCheckUtils]: 7: Hoare triple {160167#true} havoc ~lk1~0; {160167#true} is VALID [2020-07-11 01:03:57,847 INFO L280 TraceCheckUtils]: 8: Hoare triple {160167#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,847 INFO L280 TraceCheckUtils]: 9: Hoare triple {160167#true} ~p2~0 := #t~nondet1; {160167#true} is VALID [2020-07-11 01:03:57,848 INFO L280 TraceCheckUtils]: 10: Hoare triple {160167#true} havoc #t~nondet1; {160167#true} is VALID [2020-07-11 01:03:57,848 INFO L280 TraceCheckUtils]: 11: Hoare triple {160167#true} havoc ~lk2~0; {160167#true} is VALID [2020-07-11 01:03:57,848 INFO L280 TraceCheckUtils]: 12: Hoare triple {160167#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {160167#true} ~p3~0 := #t~nondet2; {160167#true} is VALID [2020-07-11 01:03:57,848 INFO L280 TraceCheckUtils]: 14: Hoare triple {160167#true} havoc #t~nondet2; {160167#true} is VALID [2020-07-11 01:03:57,849 INFO L280 TraceCheckUtils]: 15: Hoare triple {160167#true} havoc ~lk3~0; {160167#true} is VALID [2020-07-11 01:03:57,849 INFO L280 TraceCheckUtils]: 16: Hoare triple {160167#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,849 INFO L280 TraceCheckUtils]: 17: Hoare triple {160167#true} ~p4~0 := #t~nondet3; {160167#true} is VALID [2020-07-11 01:03:57,849 INFO L280 TraceCheckUtils]: 18: Hoare triple {160167#true} havoc #t~nondet3; {160167#true} is VALID [2020-07-11 01:03:57,849 INFO L280 TraceCheckUtils]: 19: Hoare triple {160167#true} havoc ~lk4~0; {160167#true} is VALID [2020-07-11 01:03:57,850 INFO L280 TraceCheckUtils]: 20: Hoare triple {160167#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,850 INFO L280 TraceCheckUtils]: 21: Hoare triple {160167#true} ~p5~0 := #t~nondet4; {160167#true} is VALID [2020-07-11 01:03:57,850 INFO L280 TraceCheckUtils]: 22: Hoare triple {160167#true} havoc #t~nondet4; {160167#true} is VALID [2020-07-11 01:03:57,850 INFO L280 TraceCheckUtils]: 23: Hoare triple {160167#true} havoc ~lk5~0; {160167#true} is VALID [2020-07-11 01:03:57,850 INFO L280 TraceCheckUtils]: 24: Hoare triple {160167#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,851 INFO L280 TraceCheckUtils]: 25: Hoare triple {160167#true} ~p6~0 := #t~nondet5; {160167#true} is VALID [2020-07-11 01:03:57,851 INFO L280 TraceCheckUtils]: 26: Hoare triple {160167#true} havoc #t~nondet5; {160167#true} is VALID [2020-07-11 01:03:57,851 INFO L280 TraceCheckUtils]: 27: Hoare triple {160167#true} havoc ~lk6~0; {160167#true} is VALID [2020-07-11 01:03:57,851 INFO L280 TraceCheckUtils]: 28: Hoare triple {160167#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,851 INFO L280 TraceCheckUtils]: 29: Hoare triple {160167#true} ~p7~0 := #t~nondet6; {160167#true} is VALID [2020-07-11 01:03:57,851 INFO L280 TraceCheckUtils]: 30: Hoare triple {160167#true} havoc #t~nondet6; {160167#true} is VALID [2020-07-11 01:03:57,878 INFO L280 TraceCheckUtils]: 31: Hoare triple {160167#true} havoc ~lk7~0; {160167#true} is VALID [2020-07-11 01:03:57,879 INFO L280 TraceCheckUtils]: 32: Hoare triple {160167#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,879 INFO L280 TraceCheckUtils]: 33: Hoare triple {160167#true} ~p8~0 := #t~nondet7; {160167#true} is VALID [2020-07-11 01:03:57,879 INFO L280 TraceCheckUtils]: 34: Hoare triple {160167#true} havoc #t~nondet7; {160167#true} is VALID [2020-07-11 01:03:57,879 INFO L280 TraceCheckUtils]: 35: Hoare triple {160167#true} havoc ~lk8~0; {160167#true} is VALID [2020-07-11 01:03:57,879 INFO L280 TraceCheckUtils]: 36: Hoare triple {160167#true} havoc ~cond~0; {160167#true} is VALID [2020-07-11 01:03:57,879 INFO L280 TraceCheckUtils]: 37: Hoare triple {160167#true} assume !false; {160167#true} is VALID [2020-07-11 01:03:57,880 INFO L280 TraceCheckUtils]: 38: Hoare triple {160167#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {160167#true} is VALID [2020-07-11 01:03:57,880 INFO L280 TraceCheckUtils]: 39: Hoare triple {160167#true} ~cond~0 := #t~nondet8; {160167#true} is VALID [2020-07-11 01:03:57,880 INFO L280 TraceCheckUtils]: 40: Hoare triple {160167#true} havoc #t~nondet8; {160167#true} is VALID [2020-07-11 01:03:57,880 INFO L280 TraceCheckUtils]: 41: Hoare triple {160167#true} assume !(0 == ~cond~0); {160167#true} is VALID [2020-07-11 01:03:57,880 INFO L280 TraceCheckUtils]: 42: Hoare triple {160167#true} ~lk1~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,881 INFO L280 TraceCheckUtils]: 43: Hoare triple {160167#true} ~lk2~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,881 INFO L280 TraceCheckUtils]: 44: Hoare triple {160167#true} ~lk3~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,881 INFO L280 TraceCheckUtils]: 45: Hoare triple {160167#true} ~lk4~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,881 INFO L280 TraceCheckUtils]: 46: Hoare triple {160167#true} ~lk5~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,881 INFO L280 TraceCheckUtils]: 47: Hoare triple {160167#true} ~lk6~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,881 INFO L280 TraceCheckUtils]: 48: Hoare triple {160167#true} ~lk7~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,882 INFO L280 TraceCheckUtils]: 49: Hoare triple {160167#true} ~lk8~0 := 0; {160167#true} is VALID [2020-07-11 01:03:57,882 INFO L280 TraceCheckUtils]: 50: Hoare triple {160167#true} assume !(0 != ~p1~0); {160167#true} is VALID [2020-07-11 01:03:57,882 INFO L280 TraceCheckUtils]: 51: Hoare triple {160167#true} assume !(0 != ~p2~0); {160167#true} is VALID [2020-07-11 01:03:57,882 INFO L280 TraceCheckUtils]: 52: Hoare triple {160167#true} assume !(0 != ~p3~0); {160167#true} is VALID [2020-07-11 01:03:57,882 INFO L280 TraceCheckUtils]: 53: Hoare triple {160167#true} assume !(0 != ~p4~0); {160167#true} is VALID [2020-07-11 01:03:57,882 INFO L280 TraceCheckUtils]: 54: Hoare triple {160167#true} assume !(0 != ~p5~0); {160167#true} is VALID [2020-07-11 01:03:57,883 INFO L280 TraceCheckUtils]: 55: Hoare triple {160167#true} assume !(0 != ~p6~0); {160167#true} is VALID [2020-07-11 01:03:57,883 INFO L280 TraceCheckUtils]: 56: Hoare triple {160167#true} assume !(0 != ~p7~0); {160167#true} is VALID [2020-07-11 01:03:57,884 INFO L280 TraceCheckUtils]: 57: Hoare triple {160167#true} assume !(0 != ~p8~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,884 INFO L280 TraceCheckUtils]: 58: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,885 INFO L280 TraceCheckUtils]: 59: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,885 INFO L280 TraceCheckUtils]: 60: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,886 INFO L280 TraceCheckUtils]: 61: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,886 INFO L280 TraceCheckUtils]: 62: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,887 INFO L280 TraceCheckUtils]: 63: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,887 INFO L280 TraceCheckUtils]: 64: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-11 01:03:57,888 INFO L280 TraceCheckUtils]: 65: Hoare triple {160171#(= 0 main_~p8~0)} assume 0 != ~p8~0; {160168#false} is VALID [2020-07-11 01:03:57,888 INFO L280 TraceCheckUtils]: 66: Hoare triple {160168#false} assume 1 != ~lk8~0; {160168#false} is VALID [2020-07-11 01:03:57,888 INFO L280 TraceCheckUtils]: 67: Hoare triple {160168#false} assume !false; {160168#false} is VALID [2020-07-11 01:03:57,890 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-11 01:03:57,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1818992100] [2020-07-11 01:03:57,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:57,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:03:57,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216325007] [2020-07-11 01:03:57,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-11 01:03:57,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:57,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:03:57,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:57,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:03:57,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:03:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:03:57,949 INFO L87 Difference]: Start difference. First operand 5479 states and 6758 transitions. Second operand 3 states. [2020-07-11 01:04:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:04:49,158 INFO L93 Difference]: Finished difference Result 15977 states and 19687 transitions. [2020-07-11 01:04:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:04:49,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-11 01:04:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:04:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:04:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-11 01:04:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:04:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-11 01:04:49,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2020-07-11 01:04:49,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:04:50,546 INFO L225 Difference]: With dead ends: 15977 [2020-07-11 01:04:50,546 INFO L226 Difference]: Without dead ends: 5479 [2020-07-11 01:04:50,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:04:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-07-11 01:05:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-07-11 01:05:09,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:05:09,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5479 states. Second operand 5479 states. [2020-07-11 01:05:09,438 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-11 01:05:09,438 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-11 01:05:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:05:10,312 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-11 01:05:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-11 01:05:10,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:05:10,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:05:10,318 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-11 01:05:10,318 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-11 01:05:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:05:11,207 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-11 01:05:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-11 01:05:11,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:05:11,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:05:11,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:05:11,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:05:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-11 01:05:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6502 transitions. [2020-07-11 01:05:12,181 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6502 transitions. Word has length 68 [2020-07-11 01:05:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:05:12,181 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6502 transitions. [2020-07-11 01:05:12,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:05:12,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6502 transitions. [2020-07-11 01:05:21,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6502 edges. 6502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:05:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-11 01:05:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-11 01:05:21,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:05:21,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:05:21,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-11 01:05:21,210 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:05:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:05:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash 875079941, now seen corresponding path program 1 times [2020-07-11 01:05:21,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:05:21,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190068303] [2020-07-11 01:05:21,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:05:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:05:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:05:21,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-11 01:05:21,247 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-11 01:05:21,248 INFO L263 TraceCheckUtils]: 0: Hoare triple {214044#true} call ULTIMATE.init(); {214044#true} is VALID [2020-07-11 01:05:21,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-11 01:05:21,248 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-11 01:05:21,248 INFO L263 TraceCheckUtils]: 3: Hoare triple {214044#true} call #t~ret9 := main(); {214044#true} is VALID [2020-07-11 01:05:21,248 INFO L280 TraceCheckUtils]: 4: Hoare triple {214044#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,248 INFO L280 TraceCheckUtils]: 5: Hoare triple {214044#true} ~p1~0 := #t~nondet0; {214044#true} is VALID [2020-07-11 01:05:21,248 INFO L280 TraceCheckUtils]: 6: Hoare triple {214044#true} havoc #t~nondet0; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {214044#true} havoc ~lk1~0; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {214044#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {214044#true} ~p2~0 := #t~nondet1; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {214044#true} havoc #t~nondet1; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 11: Hoare triple {214044#true} havoc ~lk2~0; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 12: Hoare triple {214044#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 13: Hoare triple {214044#true} ~p3~0 := #t~nondet2; {214044#true} is VALID [2020-07-11 01:05:21,249 INFO L280 TraceCheckUtils]: 14: Hoare triple {214044#true} havoc #t~nondet2; {214044#true} is VALID [2020-07-11 01:05:21,250 INFO L280 TraceCheckUtils]: 15: Hoare triple {214044#true} havoc ~lk3~0; {214044#true} is VALID [2020-07-11 01:05:21,250 INFO L280 TraceCheckUtils]: 16: Hoare triple {214044#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,250 INFO L280 TraceCheckUtils]: 17: Hoare triple {214044#true} ~p4~0 := #t~nondet3; {214044#true} is VALID [2020-07-11 01:05:21,250 INFO L280 TraceCheckUtils]: 18: Hoare triple {214044#true} havoc #t~nondet3; {214044#true} is VALID [2020-07-11 01:05:21,250 INFO L280 TraceCheckUtils]: 19: Hoare triple {214044#true} havoc ~lk4~0; {214044#true} is VALID [2020-07-11 01:05:21,251 INFO L280 TraceCheckUtils]: 20: Hoare triple {214044#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,251 INFO L280 TraceCheckUtils]: 21: Hoare triple {214044#true} ~p5~0 := #t~nondet4; {214044#true} is VALID [2020-07-11 01:05:21,251 INFO L280 TraceCheckUtils]: 22: Hoare triple {214044#true} havoc #t~nondet4; {214044#true} is VALID [2020-07-11 01:05:21,251 INFO L280 TraceCheckUtils]: 23: Hoare triple {214044#true} havoc ~lk5~0; {214044#true} is VALID [2020-07-11 01:05:21,251 INFO L280 TraceCheckUtils]: 24: Hoare triple {214044#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,251 INFO L280 TraceCheckUtils]: 25: Hoare triple {214044#true} ~p6~0 := #t~nondet5; {214044#true} is VALID [2020-07-11 01:05:21,252 INFO L280 TraceCheckUtils]: 26: Hoare triple {214044#true} havoc #t~nondet5; {214044#true} is VALID [2020-07-11 01:05:21,252 INFO L280 TraceCheckUtils]: 27: Hoare triple {214044#true} havoc ~lk6~0; {214044#true} is VALID [2020-07-11 01:05:21,252 INFO L280 TraceCheckUtils]: 28: Hoare triple {214044#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,252 INFO L280 TraceCheckUtils]: 29: Hoare triple {214044#true} ~p7~0 := #t~nondet6; {214044#true} is VALID [2020-07-11 01:05:21,252 INFO L280 TraceCheckUtils]: 30: Hoare triple {214044#true} havoc #t~nondet6; {214044#true} is VALID [2020-07-11 01:05:21,252 INFO L280 TraceCheckUtils]: 31: Hoare triple {214044#true} havoc ~lk7~0; {214044#true} is VALID [2020-07-11 01:05:21,253 INFO L280 TraceCheckUtils]: 32: Hoare triple {214044#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,253 INFO L280 TraceCheckUtils]: 33: Hoare triple {214044#true} ~p8~0 := #t~nondet7; {214044#true} is VALID [2020-07-11 01:05:21,253 INFO L280 TraceCheckUtils]: 34: Hoare triple {214044#true} havoc #t~nondet7; {214044#true} is VALID [2020-07-11 01:05:21,253 INFO L280 TraceCheckUtils]: 35: Hoare triple {214044#true} havoc ~lk8~0; {214044#true} is VALID [2020-07-11 01:05:21,253 INFO L280 TraceCheckUtils]: 36: Hoare triple {214044#true} havoc ~cond~0; {214044#true} is VALID [2020-07-11 01:05:21,253 INFO L280 TraceCheckUtils]: 37: Hoare triple {214044#true} assume !false; {214044#true} is VALID [2020-07-11 01:05:21,254 INFO L280 TraceCheckUtils]: 38: Hoare triple {214044#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {214044#true} is VALID [2020-07-11 01:05:21,254 INFO L280 TraceCheckUtils]: 39: Hoare triple {214044#true} ~cond~0 := #t~nondet8; {214044#true} is VALID [2020-07-11 01:05:21,254 INFO L280 TraceCheckUtils]: 40: Hoare triple {214044#true} havoc #t~nondet8; {214044#true} is VALID [2020-07-11 01:05:21,254 INFO L280 TraceCheckUtils]: 41: Hoare triple {214044#true} assume !(0 == ~cond~0); {214044#true} is VALID [2020-07-11 01:05:21,254 INFO L280 TraceCheckUtils]: 42: Hoare triple {214044#true} ~lk1~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,254 INFO L280 TraceCheckUtils]: 43: Hoare triple {214044#true} ~lk2~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,255 INFO L280 TraceCheckUtils]: 44: Hoare triple {214044#true} ~lk3~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,255 INFO L280 TraceCheckUtils]: 45: Hoare triple {214044#true} ~lk4~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,255 INFO L280 TraceCheckUtils]: 46: Hoare triple {214044#true} ~lk5~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,255 INFO L280 TraceCheckUtils]: 47: Hoare triple {214044#true} ~lk6~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,255 INFO L280 TraceCheckUtils]: 48: Hoare triple {214044#true} ~lk7~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,256 INFO L280 TraceCheckUtils]: 49: Hoare triple {214044#true} ~lk8~0 := 0; {214044#true} is VALID [2020-07-11 01:05:21,256 INFO L280 TraceCheckUtils]: 50: Hoare triple {214044#true} assume !(0 != ~p1~0); {214044#true} is VALID [2020-07-11 01:05:21,256 INFO L280 TraceCheckUtils]: 51: Hoare triple {214044#true} assume !(0 != ~p2~0); {214044#true} is VALID [2020-07-11 01:05:21,256 INFO L280 TraceCheckUtils]: 52: Hoare triple {214044#true} assume !(0 != ~p3~0); {214044#true} is VALID [2020-07-11 01:05:21,256 INFO L280 TraceCheckUtils]: 53: Hoare triple {214044#true} assume !(0 != ~p4~0); {214044#true} is VALID [2020-07-11 01:05:21,256 INFO L280 TraceCheckUtils]: 54: Hoare triple {214044#true} assume !(0 != ~p5~0); {214044#true} is VALID [2020-07-11 01:05:21,257 INFO L280 TraceCheckUtils]: 55: Hoare triple {214044#true} assume !(0 != ~p6~0); {214044#true} is VALID [2020-07-11 01:05:21,257 INFO L280 TraceCheckUtils]: 56: Hoare triple {214044#true} assume !(0 != ~p7~0); {214044#true} is VALID [2020-07-11 01:05:21,257 INFO L280 TraceCheckUtils]: 57: Hoare triple {214044#true} assume 0 != ~p8~0; {214044#true} is VALID [2020-07-11 01:05:21,267 INFO L280 TraceCheckUtils]: 58: Hoare triple {214044#true} ~lk8~0 := 1; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,267 INFO L280 TraceCheckUtils]: 59: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,268 INFO L280 TraceCheckUtils]: 60: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,268 INFO L280 TraceCheckUtils]: 61: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,269 INFO L280 TraceCheckUtils]: 62: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,269 INFO L280 TraceCheckUtils]: 63: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,269 INFO L280 TraceCheckUtils]: 64: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,270 INFO L280 TraceCheckUtils]: 65: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,270 INFO L280 TraceCheckUtils]: 66: Hoare triple {214048#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-11 01:05:21,271 INFO L280 TraceCheckUtils]: 67: Hoare triple {214048#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {214045#false} is VALID [2020-07-11 01:05:21,271 INFO L280 TraceCheckUtils]: 68: Hoare triple {214045#false} assume !false; {214045#false} is VALID [2020-07-11 01:05:21,273 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-11 01:05:21,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190068303] [2020-07-11 01:05:21,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:05:21,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:05:21,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810477615] [2020-07-11 01:05:21,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-11 01:05:21,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:05:21,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:05:21,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:05:21,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:05:21,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:05:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:05:21,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:05:21,339 INFO L87 Difference]: Start difference. First operand 5479 states and 6502 transitions. Second operand 3 states. [2020-07-11 01:05:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:05:40,419 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-11 01:05:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:05:40,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-11 01:05:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:05:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:05:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-11 01:05:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:05:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-11 01:05:40,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-11 01:05:40,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:05:40,519 INFO L225 Difference]: With dead ends: 5479 [2020-07-11 01:05:40,519 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 01:05:40,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:05:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 01:05:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 01:05:40,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:05:40,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 01:05:40,530 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:05:40,530 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:05:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:05:40,530 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:05:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:05:40,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:05:40,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:05:40,531 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:05:40,531 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:05:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:05:40,531 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:05:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:05:40,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:05:40,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:05:40,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:05:40,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:05:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 01:05:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 01:05:40,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-07-11 01:05:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:05:40,533 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 01:05:40,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:05:40,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 01:05:40,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:05:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:05:40,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:05:40,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-11 01:05:40,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 01:05:41,355 WARN L193 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 159 [2020-07-11 01:05:41,789 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-11 01:05:41,924 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-07-11 01:05:42,311 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 23 [2020-07-11 01:05:42,537 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-07-11 01:05:42,770 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-11 01:05:42,995 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-07-11 01:05:43,183 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 15 [2020-07-11 01:05:43,486 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 15 [2020-07-11 01:05:43,722 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-11 01:05:43,873 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 35 [2020-07-11 01:05:44,266 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 159 [2020-07-11 01:05:44,579 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 91 [2020-07-11 01:05:45,198 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 7 [2020-07-11 01:05:45,603 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 291 [2020-07-11 01:05:45,851 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2020-07-11 01:05:46,179 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-11 01:05:46,960 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-11 01:05:49,553 WARN L193 SmtUtils]: Spent 2.58 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-11 01:05:52,560 WARN L193 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-11 01:05:52,957 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-11 01:05:53,289 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:05:56,045 WARN L193 SmtUtils]: Spent 2.68 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-11 01:05:57,118 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-11 01:05:57,284 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:05:57,483 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:06:00,064 WARN L193 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-11 01:06:00,484 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-11 01:06:01,447 WARN L193 SmtUtils]: Spent 877.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:06:10,276 WARN L193 SmtUtils]: Spent 8.77 s on a formula simplification that was a NOOP. DAG size: 291 [2020-07-11 01:06:11,230 WARN L193 SmtUtils]: Spent 941.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:06:11,370 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:06:11,531 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:06:12,492 WARN L193 SmtUtils]: Spent 916.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:06:15,439 WARN L193 SmtUtils]: Spent 2.93 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-11 01:06:15,796 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:06:16,955 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-11 01:06:17,298 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:06:17,440 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:06:17,476 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:06:17,476 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:06:17,477 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:06:17,477 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:06:17,477 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 01:06:17,477 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:06:17,477 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-11 01:06:17,477 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-11 01:06:17,478 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-11 01:06:17,478 INFO L264 CegarLoopResult]: At program point L60-1(lines 33 130) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-11 01:06:17,478 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-11 01:06:17,478 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-07-11 01:06:17,478 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 135) the Hoare annotation is: true [2020-07-11 01:06:17,480 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse11 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse5 (= 0 main_~p1~0)) (.cse6 (= 1 main_~lk5~0)) (.cse13 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk1~0)) (.cse10 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse5) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse9) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse7 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse9) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse5 .cse6 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse13 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse6 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse5) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse5) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse7 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse6 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse12 .cse7 .cse0 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse9 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse11 .cse13 .cse12 .cse7 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse9) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse6 .cse9 .cse10) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse6 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse9) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse5 .cse6 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse7 .cse0 .cse3 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse7 .cse0 .cse5 .cse6 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse9 .cse10))) [2020-07-11 01:06:17,480 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-11 01:06:17,480 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 01:06:17,481 INFO L264 CegarLoopResult]: At program point L77(line 77) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-11 01:06:17,481 INFO L264 CegarLoopResult]: At program point L110-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk6~0)) (.cse4 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse1) (and .cse3 .cse5 .cse0) (and .cse4 .cse5 .cse1) (and .cse3 .cse0 .cse2) (and .cse3 .cse4 .cse5))) [2020-07-11 01:06:17,481 INFO L271 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-07-11 01:06:17,481 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-11 01:06:17,482 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-11 01:06:17,482 INFO L264 CegarLoopResult]: At program point L127(line 127) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-11 01:06:17,482 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-11 01:06:17,482 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-11 01:06:17,482 INFO L264 CegarLoopResult]: At program point L111(line 111) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-11 01:06:17,482 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 01:06:17,482 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 01:06:17,483 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-11 01:06:17,483 INFO L264 CegarLoopResult]: At program point L95-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse10 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk8~0)) (.cse6 (= 1 main_~lk7~0)) (.cse3 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse5) (and .cse1 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse8 .cse9 .cse6 .cse2 .cse7 .cse5) (and .cse0 .cse8 .cse6 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse10) (and .cse0 .cse1 .cse8 .cse9 .cse5 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse11) (and .cse1 .cse8 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse10 .cse4 .cse11) (and .cse1 .cse8 .cse9 .cse2 .cse10 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse10 .cse7) (and .cse9 .cse6 .cse3 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse1 .cse8 .cse9 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse7 .cse5 .cse11) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse10 .cse4 .cse11) (and .cse8 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse9 .cse6 .cse3 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse10 .cse11) (and .cse6 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse0 .cse8 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse9 .cse6 .cse3 .cse10 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse9 .cse6 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse6 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse6 .cse2 .cse10 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse9 .cse6 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse5) (and .cse1 .cse8 .cse10 .cse7 .cse4 .cse11) (and .cse8 .cse6 .cse10 .cse7 .cse4 .cse11) (and .cse1 .cse8 .cse2 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse10) (and .cse9 .cse6 .cse3 .cse7 .cse5 .cse11))) [2020-07-11 01:06:17,483 INFO L264 CegarLoopResult]: At program point L120-1(lines 33 130) the Hoare annotation is: (or (= 1 main_~lk8~0) (= 0 main_~p8~0)) [2020-07-11 01:06:17,483 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-11 01:06:17,483 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-11 01:06:17,483 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-11 01:06:17,484 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-11 01:06:17,484 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-11 01:06:17,484 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-11 01:06:17,484 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 135) the Hoare annotation is: true [2020-07-11 01:06:17,484 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-11 01:06:17,485 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-11 01:06:17,485 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) the Hoare annotation is: false [2020-07-11 01:06:17,485 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-11 01:06:17,485 INFO L264 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-11 01:06:17,485 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 01:06:17,487 INFO L264 CegarLoopResult]: At program point L80-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p3~0)) (.cse5 (= 1 main_~lk5~0)) (.cse2 (= 0 main_~p4~0)) (.cse0 (= 0 main_~p7~0)) (.cse13 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse12 (= 0 main_~p1~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse6) (and .cse13 .cse7 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse6) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse12 .cse5 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse12 .cse5) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse5 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse12 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse12 .cse5 .cse11) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse12 .cse5) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse13 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse12) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse13 .cse7 .cse10 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse0 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse12 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse0 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse12 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse1 .cse13 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse12 .cse11) (and .cse1 .cse13 .cse7 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse12) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse12) (and .cse1 .cse13 .cse7 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse13 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse12 .cse11))) [2020-07-11 01:06:17,487 INFO L264 CegarLoopResult]: At program point L105-1(lines 33 130) the Hoare annotation is: (let ((.cse6 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse5 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse1 .cse3) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse6 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse7 .cse6) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse7 .cse5 .cse6) (and .cse4 .cse0 .cse7 .cse3) (and .cse4 .cse7 .cse5 .cse3) (and .cse0 .cse7 .cse6 .cse1) (and .cse4 .cse0 .cse2 .cse3) (and .cse7 .cse5 .cse6 .cse1) (and .cse0 .cse7 .cse1 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2020-07-11 01:06:17,487 INFO L264 CegarLoopResult]: At program point L72-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-11 01:06:17,488 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 01:06:17,488 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 01:06:17,488 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-11 01:06:17,489 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-11 01:06:17,489 INFO L264 CegarLoopResult]: At program point L64-1(lines 33 130) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-11 01:06:17,489 INFO L264 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-11 01:06:17,489 INFO L271 CegarLoopResult]: At program point L56(lines 56 58) the Hoare annotation is: true [2020-07-11 01:06:17,489 INFO L264 CegarLoopResult]: At program point L56-2(lines 33 130) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-11 01:06:17,490 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse11 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p5~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-11 01:06:17,490 INFO L271 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-07-11 01:06:17,490 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 01:06:17,490 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 01:06:17,490 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-11 01:06:17,491 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-11 01:06:17,491 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-11 01:06:17,491 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-11 01:06:17,491 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-11 01:06:17,491 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-11 01:06:17,492 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-11 01:06:17,492 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-07-11 01:06:17,493 INFO L264 CegarLoopResult]: At program point L90-1(lines 33 130) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse12 (= 1 main_~lk5~0)) (.cse9 (= 0 main_~p7~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk7~0)) (.cse13 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 0 main_~p8~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse13 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse10 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse9 .cse8 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse9 .cse10 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse4 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse8 .cse1 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse12 .cse11) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse13 .cse6 .cse12 .cse11) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse9 .cse8 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse4 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse4) (and .cse1 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse13 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse9 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse10 .cse1 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse12 .cse11) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse7 .cse1 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse4 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse5 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse9 .cse8 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse9 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse4 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse9 .cse8 .cse10 .cse13 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse5 .cse12) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse4 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse4) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse9 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse10 .cse1 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse1 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse10 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse12) (and .cse8 .cse10 .cse1 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11))) [2020-07-11 01:06:17,493 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-11 01:06:17,493 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-11 01:06:17,493 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-11 01:06:17,494 INFO L264 CegarLoopResult]: At program point L115-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p8~0)) (.cse2 (= 1 main_~lk7~0)) (.cse0 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2020-07-11 01:06:17,494 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 01:06:17,494 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-11 01:06:17,496 INFO L264 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-11 01:06:17,496 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-11 01:06:17,496 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-11 01:06:17,496 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-11 01:06:17,496 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-11 01:06:17,496 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-11 01:06:17,496 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-11 01:06:17,497 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-11 01:06:17,497 INFO L264 CegarLoopResult]: At program point L100-1(lines 33 130) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk8~0)) (.cse5 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p8~0)) (.cse9 (= 1 main_~lk5~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse6 .cse0 .cse9 .cse7) (and .cse8 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse6 .cse1 .cse2) (and .cse0 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse1 .cse2 .cse4) (and .cse8 .cse6 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse1 .cse4 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse2) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse2 .cse4 .cse7) (and .cse6 .cse0 .cse1 .cse3 .cse9) (and .cse5 .cse8 .cse6 .cse2 .cse7) (and .cse6 .cse0 .cse3 .cse9 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse5 .cse0 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse1 .cse3 .cse4 .cse9) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse6 .cse1 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse9) (and .cse5 .cse8 .cse2 .cse4 .cse7) (and .cse8 .cse6 .cse1 .cse3 .cse9) (and .cse0 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse8 .cse4 .cse9 .cse7))) [2020-07-11 01:06:17,497 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-11 01:06:17,497 INFO L271 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-07-11 01:06:17,497 INFO L271 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-07-11 01:06:17,499 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-11 01:06:17,499 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-11 01:06:17,499 INFO L264 CegarLoopResult]: At program point L117(line 117) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-11 01:06:17,502 INFO L264 CegarLoopResult]: At program point L84-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse12 (= 0 main_~p1~0)) (.cse0 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk4~0)) (.cse1 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p7~0)) (.cse5 (= 0 main_~p5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse13 (= 0 main_~p4~0)) (.cse15 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p6~0)) (.cse11 (= 0 main_~p8~0)) (.cse14 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6))) [2020-07-11 01:06:17,502 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 01:06:17,502 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-11 01:06:17,502 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-11 01:06:17,503 INFO L264 CegarLoopResult]: At program point L76-1(lines 33 130) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-11 01:06:17,503 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-11 01:06:17,503 INFO L264 CegarLoopResult]: At program point L134(line 134) the Hoare annotation is: false [2020-07-11 01:06:17,503 INFO L264 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-11 01:06:17,504 INFO L271 CegarLoopResult]: At program point L35(lines 35 37) the Hoare annotation is: true [2020-07-11 01:06:17,504 INFO L264 CegarLoopResult]: At program point L68-1(lines 33 130) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-11 01:06:17,671 INFO L163 areAnnotationChecker]: CFG has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:06:17,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:06:17 BoogieIcfgContainer [2020-07-11 01:06:17,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:06:17,682 INFO L168 Benchmark]: Toolchain (without parser) took 332419.10 ms. Allocated memory was 139.5 MB in the beginning and 680.0 MB in the end (delta: 540.5 MB). Free memory was 100.4 MB in the beginning and 63.5 MB in the end (delta: 36.9 MB). Peak memory consumption was 577.4 MB. Max. memory is 7.1 GB. [2020-07-11 01:06:17,683 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 01:06:17,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.62 ms. Allocated memory is still 139.5 MB. Free memory was 100.2 MB in the beginning and 89.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:06:17,684 INFO L168 Benchmark]: Boogie Preprocessor took 135.01 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 89.4 MB in the beginning and 178.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:06:17,684 INFO L168 Benchmark]: RCFGBuilder took 686.90 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 143.3 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-07-11 01:06:17,685 INFO L168 Benchmark]: TraceAbstraction took 331274.36 ms. Allocated memory was 201.3 MB in the beginning and 680.0 MB in the end (delta: 478.7 MB). Free memory was 142.7 MB in the beginning and 63.5 MB in the end (delta: 79.1 MB). Peak memory consumption was 557.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:06:17,687 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.62 ms. Allocated memory is still 139.5 MB. Free memory was 100.2 MB in the beginning and 89.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.01 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 89.4 MB in the beginning and 178.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 686.90 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 143.3 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 331274.36 ms. Allocated memory was 201.3 MB in the beginning and 680.0 MB in the end (delta: 478.7 MB). Free memory was 142.7 MB in the beginning and 63.5 MB in the end (delta: 79.1 MB). Peak memory consumption was 557.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 294.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 152.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2345 SDtfs, 845 SDslu, 1664 SDs, 0 SdLazy, 79 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5479occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 2257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 10602 NumberOfFragments, 32360 HoareAnnotationTreeSize, 98 FomulaSimplifications, 323126 FormulaSimplificationTreeSizeReduction, 6.4s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 30.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 83040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...