/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.0-7d8eed3 [2020-11-07 05:12:04,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:12:04,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:12:04,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:12:04,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:12:04,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:12:04,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:12:04,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:12:04,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:12:04,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:12:04,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:12:04,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:12:04,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:12:04,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:12:04,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:12:04,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:12:04,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:12:04,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:12:04,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:12:04,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:12:04,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:12:04,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:12:04,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:12:04,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:12:04,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:12:04,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:12:04,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:12:04,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:12:04,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:12:04,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:12:04,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:12:04,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:12:04,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:12:04,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:12:04,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:12:04,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:12:04,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:12:04,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:12:04,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:12:04,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:12:04,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:12:04,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:12:04,790 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:12:04,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:12:04,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:12:04,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:12:04,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:12:04,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:12:04,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:12:04,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:12:04,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:12:04,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:12:04,794 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:12:04,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:12:04,794 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:12:04,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:12:04,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:12:04,795 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:12:04,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:12:04,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:12:04,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:12:04,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:12:04,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:12:04,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:12:04,796 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-11-07 05:12:05,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:12:05,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:12:05,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:12:05,277 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:12:05,277 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:12:05,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-11-07 05:12:05,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cdc02f7/f059b2e7c8a84099b906adf7bac6e044/FLAG28088c91a [2020-11-07 05:12:06,121 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:12:06,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-11-07 05:12:06,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cdc02f7/f059b2e7c8a84099b906adf7bac6e044/FLAG28088c91a [2020-11-07 05:12:06,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cdc02f7/f059b2e7c8a84099b906adf7bac6e044 [2020-11-07 05:12:06,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:12:06,483 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:12:06,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:12:06,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:12:06,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:12:06,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d359c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06, skipping insertion in model container [2020-11-07 05:12:06,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:12:06,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:12:06,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:12:06,721 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:12:06,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:12:06,764 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:12:06,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06 WrapperNode [2020-11-07 05:12:06,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:12:06,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:12:06,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:12:06,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:12:06,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (1/1) ... [2020-11-07 05:12:06,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:12:06,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:12:06,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:12:06,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:12:06,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (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-11-07 05:12:06,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:12:06,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:12:06,903 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:12:06,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:12:06,903 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:12:06,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:12:06,905 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:12:06,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:12:06,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:12:06,905 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:12:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:12:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:12:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:12:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:12:06,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:12:06,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:12:07,424 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:12:07,424 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 05:12:07,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:12:07 BoogieIcfgContainer [2020-11-07 05:12:07,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:12:07,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:12:07,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:12:07,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:12:07,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:12:06" (1/3) ... [2020-11-07 05:12:07,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b82800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:12:07, skipping insertion in model container [2020-11-07 05:12:07,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:06" (2/3) ... [2020-11-07 05:12:07,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b82800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:12:07, skipping insertion in model container [2020-11-07 05:12:07,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:12:07" (3/3) ... [2020-11-07 05:12:07,437 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-11-07 05:12:07,455 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:12:07,458 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:12:07,472 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:12:07,499 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:12:07,499 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:12:07,499 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:12:07,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:12:07,499 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:12:07,500 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:12:07,500 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:12:07,500 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:12:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-11-07 05:12:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 05:12:07,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:07,533 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, 1] [2020-11-07 05:12:07,533 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1694589771, now seen corresponding path program 1 times [2020-11-07 05:12:07,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:07,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [788159008] [2020-11-07 05:12:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:07,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:07,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [788159008] [2020-11-07 05:12:07,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:07,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:07,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895246000] [2020-11-07 05:12:07,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:07,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:07,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:07,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:07,915 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2020-11-07 05:12:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:08,406 INFO L93 Difference]: Finished difference Result 225 states and 305 transitions. [2020-11-07 05:12:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:08,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-11-07 05:12:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:08,423 INFO L225 Difference]: With dead ends: 225 [2020-11-07 05:12:08,423 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 05:12:08,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 05:12:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2020-11-07 05:12:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-07 05:12:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2020-11-07 05:12:08,537 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 70 [2020-11-07 05:12:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:08,538 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2020-11-07 05:12:08,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2020-11-07 05:12:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 05:12:08,542 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:08,542 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, 1, 1] [2020-11-07 05:12:08,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:12:08,543 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1874187364, now seen corresponding path program 1 times [2020-11-07 05:12:08,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:08,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331583878] [2020-11-07 05:12:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:08,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:08,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331583878] [2020-11-07 05:12:08,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:08,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:08,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685434792] [2020-11-07 05:12:08,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:08,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:08,711 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand 4 states. [2020-11-07 05:12:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:09,007 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2020-11-07 05:12:09,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:09,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-11-07 05:12:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:09,010 INFO L225 Difference]: With dead ends: 182 [2020-11-07 05:12:09,011 INFO L226 Difference]: Without dead ends: 179 [2020-11-07 05:12:09,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-07 05:12:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2020-11-07 05:12:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-07 05:12:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2020-11-07 05:12:09,048 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 71 [2020-11-07 05:12:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:09,049 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2020-11-07 05:12:09,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2020-11-07 05:12:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 05:12:09,051 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:09,052 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, 1, 1] [2020-11-07 05:12:09,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:12:09,052 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash -985099166, now seen corresponding path program 1 times [2020-11-07 05:12:09,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:09,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186821562] [2020-11-07 05:12:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:09,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:09,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186821562] [2020-11-07 05:12:09,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:09,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:09,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765227643] [2020-11-07 05:12:09,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:09,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:09,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:09,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:09,175 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand 4 states. [2020-11-07 05:12:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:09,484 INFO L93 Difference]: Finished difference Result 355 states and 483 transitions. [2020-11-07 05:12:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:09,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-11-07 05:12:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:09,488 INFO L225 Difference]: With dead ends: 355 [2020-11-07 05:12:09,488 INFO L226 Difference]: Without dead ends: 249 [2020-11-07 05:12:09,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-11-07 05:12:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2020-11-07 05:12:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-11-07 05:12:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 329 transitions. [2020-11-07 05:12:09,542 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 329 transitions. Word has length 71 [2020-11-07 05:12:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:09,542 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 329 transitions. [2020-11-07 05:12:09,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 329 transitions. [2020-11-07 05:12:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 05:12:09,544 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:09,545 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, 1, 1, 1] [2020-11-07 05:12:09,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:12:09,545 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1497949312, now seen corresponding path program 1 times [2020-11-07 05:12:09,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:09,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223001376] [2020-11-07 05:12:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:09,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:09,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223001376] [2020-11-07 05:12:09,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:09,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:09,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246382454] [2020-11-07 05:12:09,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:09,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:09,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:09,641 INFO L87 Difference]: Start difference. First operand 248 states and 329 transitions. Second operand 4 states. [2020-11-07 05:12:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:09,933 INFO L93 Difference]: Finished difference Result 302 states and 406 transitions. [2020-11-07 05:12:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:09,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-11-07 05:12:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:09,936 INFO L225 Difference]: With dead ends: 302 [2020-11-07 05:12:09,936 INFO L226 Difference]: Without dead ends: 299 [2020-11-07 05:12:09,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-07 05:12:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 248. [2020-11-07 05:12:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-11-07 05:12:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 327 transitions. [2020-11-07 05:12:09,981 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 327 transitions. Word has length 72 [2020-11-07 05:12:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:09,982 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 327 transitions. [2020-11-07 05:12:09,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 327 transitions. [2020-11-07 05:12:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 05:12:09,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:09,984 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, 1, 1, 1] [2020-11-07 05:12:09,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:12:09,984 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -465715359, now seen corresponding path program 1 times [2020-11-07 05:12:09,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:09,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524723728] [2020-11-07 05:12:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:10,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:10,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1524723728] [2020-11-07 05:12:10,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:10,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:10,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593131837] [2020-11-07 05:12:10,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:10,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:10,095 INFO L87 Difference]: Start difference. First operand 248 states and 327 transitions. Second operand 4 states. [2020-11-07 05:12:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:10,416 INFO L93 Difference]: Finished difference Result 640 states and 874 transitions. [2020-11-07 05:12:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:10,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-11-07 05:12:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:10,419 INFO L225 Difference]: With dead ends: 640 [2020-11-07 05:12:10,420 INFO L226 Difference]: Without dead ends: 437 [2020-11-07 05:12:10,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-11-07 05:12:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2020-11-07 05:12:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-11-07 05:12:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 583 transitions. [2020-11-07 05:12:10,496 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 583 transitions. Word has length 72 [2020-11-07 05:12:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:10,496 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 583 transitions. [2020-11-07 05:12:10,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 583 transitions. [2020-11-07 05:12:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:12:10,498 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:10,498 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, 1, 1, 1, 1] [2020-11-07 05:12:10,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:12:10,499 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1575507240, now seen corresponding path program 1 times [2020-11-07 05:12:10,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:10,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [579417959] [2020-11-07 05:12:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:10,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:10,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [579417959] [2020-11-07 05:12:10,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:10,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:10,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298541802] [2020-11-07 05:12:10,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:10,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:10,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:10,569 INFO L87 Difference]: Start difference. First operand 436 states and 583 transitions. Second operand 4 states. [2020-11-07 05:12:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:10,884 INFO L93 Difference]: Finished difference Result 532 states and 718 transitions. [2020-11-07 05:12:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:10,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-11-07 05:12:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:10,888 INFO L225 Difference]: With dead ends: 532 [2020-11-07 05:12:10,888 INFO L226 Difference]: Without dead ends: 529 [2020-11-07 05:12:10,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-11-07 05:12:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 436. [2020-11-07 05:12:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-11-07 05:12:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 579 transitions. [2020-11-07 05:12:10,986 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 579 transitions. Word has length 73 [2020-11-07 05:12:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:10,987 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 579 transitions. [2020-11-07 05:12:10,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 579 transitions. [2020-11-07 05:12:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:12:10,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:10,989 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, 1, 1, 1, 1] [2020-11-07 05:12:10,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:12:10,989 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:10,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1544674994, now seen corresponding path program 1 times [2020-11-07 05:12:10,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:10,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [130065830] [2020-11-07 05:12:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:11,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:11,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [130065830] [2020-11-07 05:12:11,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:11,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:11,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770051735] [2020-11-07 05:12:11,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:11,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:11,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:11,061 INFO L87 Difference]: Start difference. First operand 436 states and 579 transitions. Second operand 4 states. [2020-11-07 05:12:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:11,423 INFO L93 Difference]: Finished difference Result 1192 states and 1614 transitions. [2020-11-07 05:12:11,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:11,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-11-07 05:12:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:11,428 INFO L225 Difference]: With dead ends: 1192 [2020-11-07 05:12:11,428 INFO L226 Difference]: Without dead ends: 801 [2020-11-07 05:12:11,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-11-07 05:12:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 800. [2020-11-07 05:12:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-11-07 05:12:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1063 transitions. [2020-11-07 05:12:11,567 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1063 transitions. Word has length 73 [2020-11-07 05:12:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:11,567 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1063 transitions. [2020-11-07 05:12:11,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1063 transitions. [2020-11-07 05:12:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 05:12:11,569 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:11,569 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, 1, 1, 1, 1, 1] [2020-11-07 05:12:11,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:12:11,570 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1931575924, now seen corresponding path program 1 times [2020-11-07 05:12:11,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:11,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145242280] [2020-11-07 05:12:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:11,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:11,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145242280] [2020-11-07 05:12:11,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:11,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:11,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555124155] [2020-11-07 05:12:11,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:11,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:11,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:11,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:11,636 INFO L87 Difference]: Start difference. First operand 800 states and 1063 transitions. Second operand 4 states. [2020-11-07 05:12:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:12,011 INFO L93 Difference]: Finished difference Result 972 states and 1298 transitions. [2020-11-07 05:12:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:12,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-07 05:12:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:12,017 INFO L225 Difference]: With dead ends: 972 [2020-11-07 05:12:12,018 INFO L226 Difference]: Without dead ends: 969 [2020-11-07 05:12:12,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-11-07 05:12:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 800. [2020-11-07 05:12:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-11-07 05:12:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1055 transitions. [2020-11-07 05:12:12,136 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1055 transitions. Word has length 74 [2020-11-07 05:12:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:12,136 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1055 transitions. [2020-11-07 05:12:12,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1055 transitions. [2020-11-07 05:12:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 05:12:12,138 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:12,138 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, 1, 1, 1, 1, 1] [2020-11-07 05:12:12,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:12:12,139 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash -632673779, now seen corresponding path program 1 times [2020-11-07 05:12:12,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:12,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643654803] [2020-11-07 05:12:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:12,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:12,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643654803] [2020-11-07 05:12:12,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:12,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:12,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095656119] [2020-11-07 05:12:12,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:12,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:12,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:12,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:12,200 INFO L87 Difference]: Start difference. First operand 800 states and 1055 transitions. Second operand 4 states. [2020-11-07 05:12:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:12,695 INFO L93 Difference]: Finished difference Result 2260 states and 3010 transitions. [2020-11-07 05:12:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:12,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-07 05:12:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:12,703 INFO L225 Difference]: With dead ends: 2260 [2020-11-07 05:12:12,704 INFO L226 Difference]: Without dead ends: 1505 [2020-11-07 05:12:12,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-11-07 05:12:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1504. [2020-11-07 05:12:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-11-07 05:12:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1967 transitions. [2020-11-07 05:12:12,953 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1967 transitions. Word has length 74 [2020-11-07 05:12:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:12,953 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1967 transitions. [2020-11-07 05:12:12,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1967 transitions. [2020-11-07 05:12:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 05:12:12,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:12,956 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:12,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:12:12,956 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1018007220, now seen corresponding path program 1 times [2020-11-07 05:12:12,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:12,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014172065] [2020-11-07 05:12:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:13,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:13,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014172065] [2020-11-07 05:12:13,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:13,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:13,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134247202] [2020-11-07 05:12:13,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:13,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:13,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:13,024 INFO L87 Difference]: Start difference. First operand 1504 states and 1967 transitions. Second operand 4 states. [2020-11-07 05:12:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:13,510 INFO L93 Difference]: Finished difference Result 1812 states and 2370 transitions. [2020-11-07 05:12:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:13,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-07 05:12:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:13,520 INFO L225 Difference]: With dead ends: 1812 [2020-11-07 05:12:13,521 INFO L226 Difference]: Without dead ends: 1809 [2020-11-07 05:12:13,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2020-11-07 05:12:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1504. [2020-11-07 05:12:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-11-07 05:12:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1951 transitions. [2020-11-07 05:12:13,760 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1951 transitions. Word has length 75 [2020-11-07 05:12:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:13,760 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1951 transitions. [2020-11-07 05:12:13,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1951 transitions. [2020-11-07 05:12:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 05:12:13,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:13,763 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, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:13,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:12:13,763 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1869571642, now seen corresponding path program 1 times [2020-11-07 05:12:13,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:13,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228636744] [2020-11-07 05:12:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:13,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:13,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228636744] [2020-11-07 05:12:13,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:13,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:13,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910466618] [2020-11-07 05:12:13,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:13,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:13,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:13,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:13,830 INFO L87 Difference]: Start difference. First operand 1504 states and 1951 transitions. Second operand 4 states. [2020-11-07 05:12:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:14,626 INFO L93 Difference]: Finished difference Result 4324 states and 5634 transitions. [2020-11-07 05:12:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:14,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-07 05:12:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:14,642 INFO L225 Difference]: With dead ends: 4324 [2020-11-07 05:12:14,642 INFO L226 Difference]: Without dead ends: 2865 [2020-11-07 05:12:14,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-11-07 05:12:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2864. [2020-11-07 05:12:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2020-11-07 05:12:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3663 transitions. [2020-11-07 05:12:15,151 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3663 transitions. Word has length 75 [2020-11-07 05:12:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:15,152 INFO L481 AbstractCegarLoop]: Abstraction has 2864 states and 3663 transitions. [2020-11-07 05:12:15,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3663 transitions. [2020-11-07 05:12:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 05:12:15,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:15,156 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:15,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:12:15,156 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2129779897, now seen corresponding path program 1 times [2020-11-07 05:12:15,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:15,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414463175] [2020-11-07 05:12:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:15,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:15,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414463175] [2020-11-07 05:12:15,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:15,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:15,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879967583] [2020-11-07 05:12:15,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:15,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:15,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:15,244 INFO L87 Difference]: Start difference. First operand 2864 states and 3663 transitions. Second operand 4 states. [2020-11-07 05:12:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:16,442 INFO L93 Difference]: Finished difference Result 8308 states and 10642 transitions. [2020-11-07 05:12:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:16,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-11-07 05:12:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:16,472 INFO L225 Difference]: With dead ends: 8308 [2020-11-07 05:12:16,472 INFO L226 Difference]: Without dead ends: 5489 [2020-11-07 05:12:16,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2020-11-07 05:12:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5488. [2020-11-07 05:12:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 05:12:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6895 transitions. [2020-11-07 05:12:17,336 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6895 transitions. Word has length 76 [2020-11-07 05:12:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:17,336 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6895 transitions. [2020-11-07 05:12:17,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6895 transitions. [2020-11-07 05:12:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 05:12:17,341 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:17,341 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:17,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:12:17,342 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2034184296, now seen corresponding path program 1 times [2020-11-07 05:12:17,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:17,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120873781] [2020-11-07 05:12:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:17,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:17,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120873781] [2020-11-07 05:12:17,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:17,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:17,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59385632] [2020-11-07 05:12:17,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:17,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:17,412 INFO L87 Difference]: Start difference. First operand 5488 states and 6895 transitions. Second operand 4 states. [2020-11-07 05:12:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:18,342 INFO L93 Difference]: Finished difference Result 6516 states and 8114 transitions. [2020-11-07 05:12:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:18,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-11-07 05:12:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:18,372 INFO L225 Difference]: With dead ends: 6516 [2020-11-07 05:12:18,373 INFO L226 Difference]: Without dead ends: 6513 [2020-11-07 05:12:18,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2020-11-07 05:12:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5488. [2020-11-07 05:12:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 05:12:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6831 transitions. [2020-11-07 05:12:19,027 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6831 transitions. Word has length 76 [2020-11-07 05:12:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:19,027 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6831 transitions. [2020-11-07 05:12:19,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6831 transitions. [2020-11-07 05:12:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 05:12:19,032 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:19,033 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:19,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:12:19,033 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2132138048, now seen corresponding path program 1 times [2020-11-07 05:12:19,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:19,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1260621276] [2020-11-07 05:12:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:19,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:19,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1260621276] [2020-11-07 05:12:19,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:19,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:19,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741783260] [2020-11-07 05:12:19,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:19,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:19,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:19,101 INFO L87 Difference]: Start difference. First operand 5488 states and 6831 transitions. Second operand 4 states. [2020-11-07 05:12:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:20,151 INFO L93 Difference]: Finished difference Result 6452 states and 7922 transitions. [2020-11-07 05:12:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:20,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-07 05:12:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:20,183 INFO L225 Difference]: With dead ends: 6452 [2020-11-07 05:12:20,183 INFO L226 Difference]: Without dead ends: 6449 [2020-11-07 05:12:20,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6449 states. [2020-11-07 05:12:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6449 to 5488. [2020-11-07 05:12:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 05:12:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6767 transitions. [2020-11-07 05:12:20,987 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6767 transitions. Word has length 77 [2020-11-07 05:12:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:20,987 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6767 transitions. [2020-11-07 05:12:20,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6767 transitions. [2020-11-07 05:12:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 05:12:20,993 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:20,993 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:20,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:12:20,993 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1606312742, now seen corresponding path program 1 times [2020-11-07 05:12:20,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:20,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1553065297] [2020-11-07 05:12:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:21,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:21,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1553065297] [2020-11-07 05:12:21,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:21,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:21,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41287658] [2020-11-07 05:12:21,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:21,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:21,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:21,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:21,054 INFO L87 Difference]: Start difference. First operand 5488 states and 6767 transitions. Second operand 4 states. [2020-11-07 05:12:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:22,416 INFO L93 Difference]: Finished difference Result 15987 states and 19697 transitions. [2020-11-07 05:12:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:22,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-07 05:12:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:22,432 INFO L225 Difference]: With dead ends: 15987 [2020-11-07 05:12:22,432 INFO L226 Difference]: Without dead ends: 5488 [2020-11-07 05:12:22,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2020-11-07 05:12:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2020-11-07 05:12:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 05:12:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6511 transitions. [2020-11-07 05:12:23,072 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6511 transitions. Word has length 77 [2020-11-07 05:12:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:23,073 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6511 transitions. [2020-11-07 05:12:23,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6511 transitions. [2020-11-07 05:12:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 05:12:23,079 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:23,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:23,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:12:23,079 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1855843932, now seen corresponding path program 1 times [2020-11-07 05:12:23,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:23,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [318702590] [2020-11-07 05:12:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:23,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:23,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [318702590] [2020-11-07 05:12:23,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:23,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:23,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123433818] [2020-11-07 05:12:23,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:23,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:23,128 INFO L87 Difference]: Start difference. First operand 5488 states and 6511 transitions. Second operand 4 states. [2020-11-07 05:12:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:23,903 INFO L93 Difference]: Finished difference Result 5488 states and 6511 transitions. [2020-11-07 05:12:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:23,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-11-07 05:12:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:23,904 INFO L225 Difference]: With dead ends: 5488 [2020-11-07 05:12:23,904 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:12:23,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:12:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:12:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:12:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:12:23,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2020-11-07 05:12:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:23,916 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:12:23,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:12:23,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:12:23,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:12:23,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:12:26,612 WARN L194 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 05:12:26,889 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 39 [2020-11-07 05:12:28,395 WARN L194 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 05:12:29,760 WARN L194 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 05:12:29,896 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2020-11-07 05:12:30,167 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 85 [2020-11-07 05:12:30,564 WARN L194 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-11-07 05:12:30,742 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 53 [2020-11-07 05:12:31,767 WARN L194 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 783 DAG size of output: 31 [2020-11-07 05:12:31,927 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-11-07 05:12:32,123 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 85 [2020-11-07 05:12:32,425 WARN L194 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 499 DAG size of output: 31 [2020-11-07 05:12:32,690 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 65 [2020-11-07 05:12:32,832 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-11-07 05:12:33,205 WARN L194 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-11-07 05:12:33,714 WARN L194 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 189 [2020-11-07 05:12:34,050 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-11-07 05:12:34,192 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-11-07 05:12:35,071 WARN L194 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 769 DAG size of output: 31 [2020-11-07 05:12:35,395 WARN L194 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 53 [2020-11-07 05:12:35,683 WARN L194 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-11-07 05:12:35,819 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2020-11-07 05:12:36,091 WARN L194 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-11-07 05:12:36,253 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-11-07 05:12:37,609 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 05:12:38,340 WARN L194 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 45 [2020-11-07 05:12:38,711 WARN L194 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-11-07 05:12:38,863 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 65 [2020-11-07 05:12:40,028 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 05:12:40,830 WARN L194 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 743 DAG size of output: 31 [2020-11-07 05:12:41,382 WARN L194 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 189 [2020-11-07 05:12:41,486 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-11-07 05:12:41,885 WARN L194 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 121 [2020-11-07 05:12:43,238 WARN L194 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 798 DAG size of output: 39 [2020-11-07 05:12:44,337 WARN L194 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 791 DAG size of output: 31 [2020-11-07 05:12:45,264 WARN L194 SmtUtils]: Spent 925.00 ms on a formula simplification that was a NOOP. DAG size: 321 [2020-11-07 05:12:45,573 WARN L194 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 121 [2020-11-07 05:12:45,755 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 67 [2020-11-07 05:12:45,896 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-11-07 05:12:46,506 WARN L194 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 693 DAG size of output: 31 [2020-11-07 05:12:46,658 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-11-07 05:12:46,947 WARN L194 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-11-07 05:12:48,110 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 05:12:49,267 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:12:49,480 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:12:49,730 WARN L194 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:12:52,812 WARN L194 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 05:12:53,954 WARN L194 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:12:54,468 WARN L194 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:12:54,602 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:13:01,962 WARN L194 SmtUtils]: Spent 7.34 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 05:13:02,170 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:13:10,277 WARN L194 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-11-07 05:13:11,558 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 05:13:12,695 WARN L194 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:13:12,910 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:13:20,342 WARN L194 SmtUtils]: Spent 7.37 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 05:13:23,469 WARN L194 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 05:13:24,015 WARN L194 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:13:24,742 WARN L194 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:13:32,171 WARN L194 SmtUtils]: Spent 7.42 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 05:13:33,451 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 05:13:33,699 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:13:36,516 WARN L194 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 05:13:58,186 WARN L194 SmtUtils]: Spent 21.50 s on a formula simplification. DAG size of input: 311 DAG size of output: 291 [2020-11-07 05:14:00,984 WARN L194 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 05:14:01,458 WARN L194 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:14:02,009 WARN L194 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:14:02,123 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:14:04,925 WARN L194 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 05:14:13,034 WARN L194 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-11-07 05:14:13,042 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,042 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,042 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,043 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,043 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,043 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,043 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:14:13,043 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,043 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:14:13,044 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,044 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:14:13,044 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,044 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 05:14:13,044 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:14:13,044 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:14:13,044 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:14:13,044 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:14:13,045 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:14:13,047 INFO L262 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse8 (= main_~p6~0 0)) (.cse11 (= main_~p4~0 0)) (.cse13 (= main_~lk3~0 1)) (.cse14 (= main_~lk8~0 1)) (.cse12 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p5~0 0)) (.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk1~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse13 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse13 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse13 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse13 .cse8 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse1 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse13 .cse8 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse13 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse1 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse1 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse13 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7))) [2020-11-07 05:14:13,047 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 05:14:13,047 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2020-11-07 05:14:13,048 INFO L262 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2020-11-07 05:14:13,048 INFO L269 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-11-07 05:14:13,048 INFO L269 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-11-07 05:14:13,048 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 05:14:13,048 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 05:14:13,048 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 05:14:13,048 INFO L262 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: false [2020-11-07 05:14:13,049 INFO L262 CegarLoopResult]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~p8~0 0)) (.cse6 (= main_~lk6~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~p5~0 0)) (.cse7 (= main_~lk8~0 1)) (.cse3 (= main_~p4~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse0 .cse9 .cse7 .cse3 .cse8) (and .cse9 .cse6 .cse7 .cse3 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse4) (and .cse5 .cse9 .cse6 .cse7 .cse8) (and .cse1 .cse6 .cse3 .cse8 .cse4) (and .cse1 .cse9 .cse6 .cse3 .cse8) (and .cse5 .cse0 .cse9 .cse7 .cse8) (and .cse0 .cse7 .cse3 .cse8 .cse4) (and .cse5 .cse2 .cse9 .cse6 .cse7) (and .cse2 .cse6 .cse7 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse9) (and .cse5 .cse0 .cse1 .cse9 .cse8) (and .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse0 .cse2 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse8 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse2 .cse9 .cse7 .cse3) (and .cse1 .cse2 .cse9 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse2 .cse6 .cse7 .cse4) (and .cse5 .cse1 .cse9 .cse6 .cse8) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse2 .cse9 .cse6 .cse7 .cse3) (and .cse5 .cse1 .cse2 .cse9 .cse6) (and .cse5 .cse0 .cse7 .cse8 .cse4) (and .cse6 .cse7 .cse3 .cse8 .cse4) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4))) [2020-11-07 05:14:13,049 INFO L269 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-11-07 05:14:13,049 INFO L269 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: true [2020-11-07 05:14:13,049 INFO L269 CegarLoopResult]: At program point L36-2(line 36) the Hoare annotation is: true [2020-11-07 05:14:13,051 INFO L262 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse8 (= main_~p6~0 0)) (.cse11 (= main_~p4~0 0)) (.cse13 (= main_~lk3~0 1)) (.cse14 (= main_~lk8~0 1)) (.cse12 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p5~0 0)) (.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk1~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse13 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse13 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse13 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse13 .cse8 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse1 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse13 .cse8 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse13 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse1 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse1 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse13 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7))) [2020-11-07 05:14:13,051 INFO L269 CegarLoopResult]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2020-11-07 05:14:13,051 INFO L262 CegarLoopResult]: At program point L119(line 119) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2020-11-07 05:14:13,053 INFO L262 CegarLoopResult]: At program point L86-1(lines 35 132) the Hoare annotation is: (let ((.cse12 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse14 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse15 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~p1~0 0)) (.cse13 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse4 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse15 .cse6 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse8 .cse9 .cse5 .cse15 .cse7 .cse11 .cse13) (and .cse8 .cse9 .cse5 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse9 .cse10 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse4 .cse5 .cse15 .cse6 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse4 .cse15 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse15 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse1 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse14 .cse1 .cse2 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse9 .cse3 .cse5 .cse15 .cse12 .cse13) (and .cse1 .cse9 .cse3 .cse5 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse7 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse8 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse15 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse7) (and .cse14 .cse1 .cse9 .cse3 .cse15 .cse10 .cse7 .cse13) (and .cse8 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse15 .cse6 .cse7) (and .cse8 .cse14 .cse9 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse0 .cse8 .cse4 .cse5 .cse15 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse12) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse15 .cse6 .cse12) (and .cse8 .cse3 .cse5 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse8 .cse14 .cse2 .cse4 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse3 .cse15 .cse10 .cse12 .cse13) (and .cse1 .cse3 .cse5 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse4 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse4 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12 .cse13) (and .cse1 .cse9 .cse5 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse9 .cse5 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse4 .cse15 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse12) (and .cse8 .cse14 .cse4 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse3 .cse5 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse10 .cse12) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse3 .cse5 .cse15 .cse10 .cse12 .cse13) (and .cse8 .cse4 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse10 .cse7) (and .cse0 .cse8 .cse14 .cse4 .cse15 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse9 .cse4 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse15 .cse6 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse3 .cse15 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse15 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse10 .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse8 .cse9 .cse5 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse2 .cse9 .cse3 .cse5 .cse10 .cse12 .cse13) (and .cse8 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse10 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse5 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse2 .cse5 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse4 .cse15 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse3 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse3 .cse5 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse9 .cse4 .cse5 .cse15 .cse10 .cse7 .cse11) (and .cse8 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse7 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse4 .cse15 .cse7 .cse11) (and .cse8 .cse14 .cse9 .cse4 .cse15 .cse10 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse4 .cse10 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse9 .cse3 .cse5 .cse15 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse7) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse1 .cse9 .cse5 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse15 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse8 .cse14 .cse2 .cse9 .cse4 .cse10 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse4 .cse15 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse12) (and .cse8 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse7) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse15 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse5 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse4 .cse15 .cse10 .cse6 .cse12) (and .cse8 .cse2 .cse9 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse8 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse12) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse3 .cse4 .cse15 .cse10 .cse6 .cse7) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse7) (and .cse14 .cse1 .cse3 .cse4 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse5 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse9 .cse4 .cse5 .cse15 .cse11 .cse12) (and .cse8 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse8 .cse9 .cse3 .cse5 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse3 .cse5 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse3 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse14 .cse1 .cse2 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse7 .cse11) (and .cse8 .cse14 .cse3 .cse4 .cse15 .cse10 .cse6 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse14 .cse1 .cse9 .cse4 .cse15 .cse10 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse4 .cse11 .cse12) (and .cse8 .cse14 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse9 .cse4 .cse5 .cse15 .cse7 .cse11) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse15 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse4 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse14 .cse1 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse3 .cse5 .cse10 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse7 .cse11) (and .cse0 .cse1 .cse5 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse9 .cse4 .cse5 .cse15 .cse10 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse10 .cse7 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse14 .cse1 .cse4 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse5 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse3 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse4 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse2 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse15 .cse10 .cse7 .cse11) (and .cse8 .cse14 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse15 .cse11 .cse12) (and .cse8 .cse14 .cse4 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse1 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse9 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse9 .cse4 .cse15 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse8 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse12) (and .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse10 .cse7) (and .cse0 .cse8 .cse14 .cse3 .cse4 .cse15 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse5 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse5 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse4 .cse15 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse1 .cse9 .cse3 .cse5 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse6 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse12) (and .cse0 .cse1 .cse9 .cse5 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse9 .cse5 .cse15 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse2 .cse4 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse3 .cse4 .cse15 .cse6 .cse12) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse7) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse8 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse9 .cse5 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse4 .cse15 .cse7 .cse11) (and .cse14 .cse1 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse12) (and .cse14 .cse1 .cse9 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse5 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse4 .cse5 .cse15 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse3 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse3 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse4 .cse7 .cse11) (and .cse1 .cse3 .cse5 .cse15 .cse10 .cse6 .cse7 .cse13))) [2020-11-07 05:14:13,054 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 05:14:13,054 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 05:14:13,054 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 05:14:13,055 INFO L262 CegarLoopResult]: At program point L78-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-11-07 05:14:13,055 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 05:14:13,055 INFO L262 CegarLoopResult]: At program point L136(line 136) the Hoare annotation is: false [2020-11-07 05:14:13,055 INFO L262 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2020-11-07 05:14:13,055 INFO L269 CegarLoopResult]: At program point L37(lines 37 39) the Hoare annotation is: true [2020-11-07 05:14:13,056 INFO L262 CegarLoopResult]: At program point L70-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 05:14:13,056 INFO L262 CegarLoopResult]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2020-11-07 05:14:13,056 INFO L262 CegarLoopResult]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2020-11-07 05:14:13,056 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 05:14:13,056 INFO L262 CegarLoopResult]: At program point L62-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 05:14:13,056 INFO L269 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-11-07 05:14:13,056 INFO L269 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-11-07 05:14:13,058 INFO L262 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2020-11-07 05:14:13,058 INFO L269 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-11-07 05:14:13,058 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 05:14:13,058 INFO L262 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-11-07 05:14:13,058 INFO L262 CegarLoopResult]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse2 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse3 .cse4 .cse5) (and .cse0 .cse5 .cse2) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse4 .cse5 .cse2))) [2020-11-07 05:14:13,059 INFO L269 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-11-07 05:14:13,059 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2020-11-07 05:14:13,059 INFO L262 CegarLoopResult]: At program point L104(line 104) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2020-11-07 05:14:13,059 INFO L262 CegarLoopResult]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 05:14:13,059 INFO L262 CegarLoopResult]: At program point L129(line 129) the Hoare annotation is: (= main_~lk8~0 1) [2020-11-07 05:14:13,060 INFO L262 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:14:13,060 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 05:14:13,060 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2020-11-07 05:14:13,060 INFO L262 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2020-11-07 05:14:13,060 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 05:14:13,060 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 05:14:13,060 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 05:14:13,061 INFO L262 CegarLoopResult]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse9 (= main_~lk8~0 1)) (.cse3 (= main_~p4~0 0)) (.cse7 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse10 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse9 .cse4) (and .cse6 .cse10 .cse7 .cse9 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse11 .cse2 .cse5) (and .cse10 .cse7 .cse11 .cse8 .cse9 .cse3) (and .cse7 .cse11 .cse8 .cse2 .cse9 .cse3) (and .cse10 .cse7 .cse11 .cse9 .cse3 .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse10 .cse7 .cse1 .cse11 .cse8 .cse3) (and .cse6 .cse10 .cse7 .cse11 .cse8 .cse9) (and .cse7 .cse1 .cse11 .cse8 .cse2 .cse3) (and .cse6 .cse10 .cse7 .cse1 .cse11 .cse8) (and .cse0 .cse11 .cse2 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse10 .cse11 .cse8 .cse9) (and .cse6 .cse0 .cse1 .cse8 .cse2 .cse4) (and .cse6 .cse0 .cse8 .cse2 .cse9 .cse4) (and .cse6 .cse7 .cse1 .cse8 .cse2 .cse4) (and .cse6 .cse0 .cse1 .cse11 .cse8 .cse2) (and .cse10 .cse7 .cse8 .cse9 .cse3 .cse4) (and .cse6 .cse10 .cse7 .cse11 .cse9 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse3 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse11 .cse5) (and .cse0 .cse1 .cse11 .cse8 .cse2 .cse3) (and .cse7 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse1 .cse11 .cse2 .cse5) (and .cse6 .cse10 .cse7 .cse8 .cse9 .cse4) (and .cse7 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse2 .cse9 .cse3 .cse4) (and .cse0 .cse10 .cse9 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse11 .cse8 .cse2 .cse9) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse10 .cse7 .cse9 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse9 .cse3) (and .cse6 .cse0 .cse10 .cse8 .cse9 .cse4) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4) (and .cse6 .cse7 .cse1 .cse11 .cse8 .cse2) (and .cse10 .cse7 .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse9 .cse4 .cse5) (and .cse6 .cse0 .cse10 .cse9 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse6 .cse10 .cse7 .cse1 .cse4 .cse5) (and .cse6 .cse0 .cse11 .cse2 .cse9 .cse5) (and .cse10 .cse7 .cse1 .cse8 .cse3 .cse4) (and .cse6 .cse7 .cse11 .cse8 .cse2 .cse9) (and .cse0 .cse10 .cse11 .cse9 .cse3 .cse5) (and .cse0 .cse10 .cse8 .cse9 .cse3 .cse4) (and .cse0 .cse11 .cse8 .cse2 .cse9 .cse3) (and .cse6 .cse0 .cse10 .cse1 .cse8 .cse4) (and .cse6 .cse0 .cse10 .cse11 .cse9 .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse11 .cse8) (and .cse6 .cse10 .cse7 .cse1 .cse8 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse3) (and .cse6 .cse7 .cse11 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse2 .cse9 .cse4 .cse5) (and .cse7 .cse11 .cse2 .cse9 .cse3 .cse5) (and .cse6 .cse10 .cse7 .cse1 .cse11 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse4 .cse5))) [2020-11-07 05:14:13,061 INFO L262 CegarLoopResult]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2020-11-07 05:14:13,061 INFO L269 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-11-07 05:14:13,061 INFO L269 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-11-07 05:14:13,062 INFO L269 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-11-07 05:14:13,062 INFO L262 CegarLoopResult]: At program point L114(line 114) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2020-11-07 05:14:13,062 INFO L269 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-11-07 05:14:13,062 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 05:14:13,062 INFO L269 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-11-07 05:14:13,063 INFO L262 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p4~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse8 (= main_~p6~0 0)) (.cse12 (= main_~lk7~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse2) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse8 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse4 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse8 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse10 .cse8 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse10 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse12) (and .cse11 .cse10 .cse8 .cse1 .cse4 .cse6 .cse12) (and .cse10 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse2) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse11 .cse10 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse12) (and .cse10 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse10 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse1 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse6))) [2020-11-07 05:14:13,063 INFO L262 CegarLoopResult]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2020-11-07 05:14:13,063 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 05:14:13,065 INFO L262 CegarLoopResult]: At program point L82-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2020-11-07 05:14:13,065 INFO L262 CegarLoopResult]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse0 (= main_~p6~0 0)) (.cse7 (= main_~p8~0 0)) (.cse2 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse6) (and .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse4) (and .cse1 .cse4 .cse3 .cse6) (and .cse0 .cse7 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse2) (and .cse0 .cse7 .cse1 .cse6) (and .cse7 .cse2 .cse4 .cse5) (and .cse2 .cse4 .cse3 .cse5) (and .cse0 .cse7 .cse2 .cse5))) [2020-11-07 05:14:13,065 INFO L262 CegarLoopResult]: At program point L74-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-11-07 05:14:13,065 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 05:14:13,066 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 05:14:13,066 INFO L262 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p4~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse8 (= main_~p6~0 0)) (.cse12 (= main_~lk7~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse2) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse8 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse4 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse8 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse10 .cse8 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse10 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse12) (and .cse11 .cse10 .cse8 .cse1 .cse4 .cse6 .cse12) (and .cse10 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse2) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse11 .cse10 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse12) (and .cse10 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse10 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse1 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse6))) [2020-11-07 05:14:13,066 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 05:14:13,067 INFO L262 CegarLoopResult]: At program point L66-1(lines 35 132) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 05:14:13,067 INFO L262 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2020-11-07 05:14:13,067 INFO L269 CegarLoopResult]: At program point L58(lines 58 60) the Hoare annotation is: true [2020-11-07 05:14:13,067 INFO L262 CegarLoopResult]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:14:13,068 INFO L262 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-11-07 05:14:13,068 INFO L269 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-11-07 05:14:13,068 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 05:14:13,068 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 05:14:13,068 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 05:14:13,068 INFO L262 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse4 .cse7) (and .cse0 .cse5 .cse3 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse3 .cse8 .cse4 .cse6) (and .cse0 .cse5 .cse8 .cse6 .cse7) (and .cse0 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse8 .cse7))) [2020-11-07 05:14:13,069 INFO L262 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 05:14:13,069 INFO L269 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-11-07 05:14:13,069 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 05:14:13,069 INFO L269 CegarLoopResult]: At program point L133(lines 7 137) the Hoare annotation is: true [2020-11-07 05:14:13,069 INFO L262 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 05:14:13,069 INFO L269 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: true [2020-11-07 05:14:13,071 INFO L262 CegarLoopResult]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p5~0 0)) (.cse8 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse13 (= main_~lk2~0 1)) (.cse12 (= main_~p7~0 0)) (.cse7 (= main_~lk3~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse1 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse7 .cse9 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse13 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse12 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse13 .cse2 .cse6) (and .cse1 .cse9 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse12 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse3 .cse6) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse13 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse13 .cse12 .cse10 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse13 .cse10 .cse4 .cse6) (and .cse7 .cse9 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse13 .cse12 .cse2) (and .cse1 .cse9 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse0 .cse7 .cse9 .cse12 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse12 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse12 .cse5) (and .cse1 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse7 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse12 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse12 .cse2) (and .cse7 .cse9 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse1 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse0 .cse7 .cse9 .cse11 .cse2 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse10 .cse6) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse3 .cse6) (and .cse7 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse1 .cse9 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse10 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse12 .cse4 .cse5) (and .cse0 .cse7 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse12 .cse4) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse7 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse0 .cse7 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse7 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse1 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse7 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse1 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse1 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse8 .cse1 .cse9 .cse13 .cse12 .cse10 .cse4) (and .cse7 .cse9 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse7 .cse8 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse2 .cse6) (and .cse8 .cse1 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse3) (and .cse0 .cse7 .cse8 .cse9 .cse12 .cse4 .cse5) (and .cse7 .cse9 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5 .cse6) (and .cse1 .cse9 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse12 .cse10 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse11 .cse12 .cse3 .cse5) (and .cse0 .cse7 .cse8 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse13 .cse12 .cse2 .cse4) (and .cse1 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse12 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse11 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse7 .cse8 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse13 .cse12 .cse3 .cse4) (and .cse1 .cse9 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse0 .cse7 .cse9 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse7 .cse9 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse12 .cse3) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse12 .cse10 .cse5) (and .cse7 .cse9 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse1 .cse9 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse0 .cse7 .cse8 .cse13 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse1 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse7 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse0 .cse7 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse1 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse13 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse13 .cse6) (and .cse7 .cse8 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse0 .cse1 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse9 .cse11 .cse2 .cse5 .cse6) (and .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse12 .cse2 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse13 .cse12 .cse4) (and .cse0 .cse1 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse13 .cse3 .cse4 .cse6) (and .cse1 .cse9 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse1 .cse9 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse4 .cse6) (and .cse0 .cse1 .cse9 .cse13 .cse12 .cse2 .cse4) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6))) [2020-11-07 05:14:13,071 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 05:14:13,071 INFO L269 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-11-07 05:14:13,071 INFO L269 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-11-07 05:14:13,071 INFO L262 CegarLoopResult]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse2 .cse3))) [2020-11-07 05:14:13,071 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 05:14:13,071 INFO L262 CegarLoopResult]: At program point L109(line 109) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse4 .cse7) (and .cse0 .cse5 .cse3 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse3 .cse8 .cse4 .cse6) (and .cse0 .cse5 .cse8 .cse6 .cse7) (and .cse0 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse8 .cse7))) [2020-11-07 05:14:13,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:14:13 BoogieIcfgContainer [2020-11-07 05:14:13,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:14:13,087 INFO L168 Benchmark]: Toolchain (without parser) took 126611.69 ms. Allocated memory was 162.5 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 138.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. [2020-11-07 05:14:13,088 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 162.5 MB. Free memory is still 137.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:14:13,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.55 ms. Allocated memory is still 162.5 MB. Free memory was 137.5 MB in the beginning and 127.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:14:13,089 INFO L168 Benchmark]: Boogie Preprocessor took 41.11 ms. Allocated memory is still 162.5 MB. Free memory was 127.5 MB in the beginning and 126.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:14:13,090 INFO L168 Benchmark]: RCFGBuilder took 618.24 ms. Allocated memory is still 162.5 MB. Free memory was 125.9 MB in the beginning and 138.9 MB in the end (delta: -13.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:14:13,090 INFO L168 Benchmark]: TraceAbstraction took 125656.95 ms. Allocated memory was 162.5 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 138.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. [2020-11-07 05:14:13,092 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 162.5 MB. Free memory is still 137.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 279.55 ms. Allocated memory is still 162.5 MB. Free memory was 137.5 MB in the beginning and 127.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.11 ms. Allocated memory is still 162.5 MB. Free memory was 127.5 MB in the beginning and 126.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 618.24 ms. Allocated memory is still 162.5 MB. Free memory was 125.9 MB in the beginning and 138.9 MB in the end (delta: -13.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 125656.95 ms. Allocated memory was 162.5 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 138.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 109.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2488 SDtfs, 2889 SDslu, 271 SDs, 0 SdLazy, 1790 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5488occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 2639 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 110 LocationsWithAnnotation, 170 PreInvPairs, 10674 NumberOfFragments, 32402 HoareAnnotationTreeSize, 170 FomulaSimplifications, 4159407 FormulaSimplificationTreeSizeReduction, 24.1s HoareSimplificationTime, 110 FomulaSimplificationsInter, 47378 FormulaSimplificationTreeSizeReductionInter, 84.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 140256 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...