/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 -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 00:47:08,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:47:08,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:47:08,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:47:08,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:47:08,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:47:08,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:47:08,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:47:08,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:47:08,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:47:08,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:47:08,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:47:08,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:47:08,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:47:08,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:47:08,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:47:08,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:47:08,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:47:08,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:47:08,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:47:08,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:47:08,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:47:08,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:47:08,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:47:08,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:47:08,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:47:08,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:47:08,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:47:08,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:47:08,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:47:08,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:47:08,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:47:08,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:47:08,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:47:08,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:47:08,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:47:08,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:47:08,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:47:08,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:47:08,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:47:08,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:47:08,631 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 00:47:08,653 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:47:08,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:47:08,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:47:08,659 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:47:08,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:47:08,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:47:08,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:47:08,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:47:08,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:47:08,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:47:08,662 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:47:08,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:47:08,662 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:47:08,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:47:08,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:47:08,663 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:47:08,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:47:08,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:47:08,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:47:08,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:47:08,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:47:08,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:47:08,665 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 [2020-11-07 00:47:09,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:47:09,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:47:09,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:47:09,101 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:47:09,101 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:47:09,102 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 00:47:09,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc976480/dd054550f0054f3ca7e55e862b174242/FLAG0252bdd08 [2020-11-07 00:47:09,885 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:47:09,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-11-07 00:47:09,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc976480/dd054550f0054f3ca7e55e862b174242/FLAG0252bdd08 [2020-11-07 00:47:10,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc976480/dd054550f0054f3ca7e55e862b174242 [2020-11-07 00:47:10,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:47:10,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:47:10,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:47:10,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:47:10,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:47:10,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686cfb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10, skipping insertion in model container [2020-11-07 00:47:10,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:47:10,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:47:10,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:47:10,498 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:47:10,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:47:10,540 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:47:10,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10 WrapperNode [2020-11-07 00:47:10,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:47:10,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:47:10,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:47:10,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:47:10,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (1/1) ... [2020-11-07 00:47:10,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:47:10,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:47:10,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:47:10,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:47:10,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (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 00:47:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:47:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:47:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:47:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:47:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:47:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:47:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:47:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:47:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:47:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:47:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:47:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:47:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:47:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:47:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:47:10,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:47:11,208 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:47:11,209 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 00:47:11,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:47:11 BoogieIcfgContainer [2020-11-07 00:47:11,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:47:11,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:47:11,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:47:11,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:47:11,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:47:10" (1/3) ... [2020-11-07 00:47:11,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c4e8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:47:11, skipping insertion in model container [2020-11-07 00:47:11,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:47:10" (2/3) ... [2020-11-07 00:47:11,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c4e8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:47:11, skipping insertion in model container [2020-11-07 00:47:11,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:47:11" (3/3) ... [2020-11-07 00:47:11,221 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-11-07 00:47:11,237 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:47:11,242 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:47:11,255 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:47:11,280 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:47:11,280 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:47:11,281 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:47:11,281 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:47:11,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:47:11,281 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:47:11,281 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:47:11,281 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:47:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-11-07 00:47:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 00:47:11,312 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:11,313 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 00:47:11,314 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1694589771, now seen corresponding path program 1 times [2020-11-07 00:47:11,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:11,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450308302] [2020-11-07 00:47:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:11,406 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:11,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:11,672 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 00:47:11,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450308302] [2020-11-07 00:47:11,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:11,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:11,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629952359] [2020-11-07 00:47:11,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:11,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:11,703 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2020-11-07 00:47:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:12,202 INFO L93 Difference]: Finished difference Result 225 states and 305 transitions. [2020-11-07 00:47:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:12,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-11-07 00:47:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:12,218 INFO L225 Difference]: With dead ends: 225 [2020-11-07 00:47:12,219 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 00:47:12,223 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 00:47:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 00:47:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2020-11-07 00:47:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-07 00:47:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2020-11-07 00:47:12,322 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 70 [2020-11-07 00:47:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:12,323 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2020-11-07 00:47:12,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2020-11-07 00:47:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 00:47:12,327 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:12,327 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 00:47:12,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:47:12,328 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1874187364, now seen corresponding path program 1 times [2020-11-07 00:47:12,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:12,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548277083] [2020-11-07 00:47:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:12,333 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:12,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:12,493 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 00:47:12,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548277083] [2020-11-07 00:47:12,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:12,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:12,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779761334] [2020-11-07 00:47:12,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:12,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:12,497 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand 4 states. [2020-11-07 00:47:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:12,850 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2020-11-07 00:47:12,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:12,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-11-07 00:47:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:12,854 INFO L225 Difference]: With dead ends: 182 [2020-11-07 00:47:12,854 INFO L226 Difference]: Without dead ends: 179 [2020-11-07 00:47:12,856 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 00:47:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-07 00:47:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2020-11-07 00:47:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-07 00:47:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2020-11-07 00:47:12,899 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 71 [2020-11-07 00:47:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:12,900 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2020-11-07 00:47:12,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2020-11-07 00:47:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 00:47:12,902 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:12,902 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 00:47:12,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:47:12,903 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash -985099166, now seen corresponding path program 1 times [2020-11-07 00:47:12,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:12,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [529840503] [2020-11-07 00:47:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:12,908 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:12,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:13,017 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 00:47:13,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [529840503] [2020-11-07 00:47:13,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:13,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:13,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961456488] [2020-11-07 00:47:13,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:13,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:13,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:13,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:13,020 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand 4 states. [2020-11-07 00:47:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:13,329 INFO L93 Difference]: Finished difference Result 355 states and 483 transitions. [2020-11-07 00:47:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:13,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-11-07 00:47:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:13,333 INFO L225 Difference]: With dead ends: 355 [2020-11-07 00:47:13,333 INFO L226 Difference]: Without dead ends: 249 [2020-11-07 00:47:13,334 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 00:47:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-11-07 00:47:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2020-11-07 00:47:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-11-07 00:47:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 329 transitions. [2020-11-07 00:47:13,386 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 329 transitions. Word has length 71 [2020-11-07 00:47:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:13,387 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 329 transitions. [2020-11-07 00:47:13,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 329 transitions. [2020-11-07 00:47:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:47:13,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:13,389 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 00:47:13,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:47:13,390 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1497949312, now seen corresponding path program 1 times [2020-11-07 00:47:13,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:13,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1333065103] [2020-11-07 00:47:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:13,406 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:13,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:13,495 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 00:47:13,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1333065103] [2020-11-07 00:47:13,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:13,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:13,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027409240] [2020-11-07 00:47:13,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:13,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:13,498 INFO L87 Difference]: Start difference. First operand 248 states and 329 transitions. Second operand 4 states. [2020-11-07 00:47:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:13,787 INFO L93 Difference]: Finished difference Result 302 states and 406 transitions. [2020-11-07 00:47:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:13,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-11-07 00:47:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:13,790 INFO L225 Difference]: With dead ends: 302 [2020-11-07 00:47:13,791 INFO L226 Difference]: Without dead ends: 299 [2020-11-07 00:47:13,791 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 00:47:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-07 00:47:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 248. [2020-11-07 00:47:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-11-07 00:47:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 327 transitions. [2020-11-07 00:47:13,839 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 327 transitions. Word has length 72 [2020-11-07 00:47:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:13,840 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 327 transitions. [2020-11-07 00:47:13,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 327 transitions. [2020-11-07 00:47:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:47:13,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:13,842 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 00:47:13,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:47:13,843 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash -465715359, now seen corresponding path program 1 times [2020-11-07 00:47:13,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:13,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780267076] [2020-11-07 00:47:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:13,847 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:13,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:13,924 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 00:47:13,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780267076] [2020-11-07 00:47:13,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:13,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:13,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920800401] [2020-11-07 00:47:13,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:13,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:13,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:13,927 INFO L87 Difference]: Start difference. First operand 248 states and 327 transitions. Second operand 4 states. [2020-11-07 00:47:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:14,253 INFO L93 Difference]: Finished difference Result 640 states and 874 transitions. [2020-11-07 00:47:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:14,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-11-07 00:47:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:14,257 INFO L225 Difference]: With dead ends: 640 [2020-11-07 00:47:14,257 INFO L226 Difference]: Without dead ends: 437 [2020-11-07 00:47:14,259 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 00:47:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-11-07 00:47:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2020-11-07 00:47:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-11-07 00:47:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 583 transitions. [2020-11-07 00:47:14,335 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 583 transitions. Word has length 72 [2020-11-07 00:47:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:14,336 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 583 transitions. [2020-11-07 00:47:14,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 583 transitions. [2020-11-07 00:47:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:47:14,338 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:14,338 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 00:47:14,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:47:14,339 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1575507240, now seen corresponding path program 1 times [2020-11-07 00:47:14,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:14,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1973116408] [2020-11-07 00:47:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:14,342 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:14,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:14,415 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 00:47:14,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1973116408] [2020-11-07 00:47:14,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:14,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:14,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159981177] [2020-11-07 00:47:14,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:14,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:14,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:14,418 INFO L87 Difference]: Start difference. First operand 436 states and 583 transitions. Second operand 4 states. [2020-11-07 00:47:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:14,752 INFO L93 Difference]: Finished difference Result 532 states and 718 transitions. [2020-11-07 00:47:14,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:14,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-11-07 00:47:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:14,756 INFO L225 Difference]: With dead ends: 532 [2020-11-07 00:47:14,756 INFO L226 Difference]: Without dead ends: 529 [2020-11-07 00:47:14,757 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 00:47:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-11-07 00:47:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 436. [2020-11-07 00:47:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-11-07 00:47:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 579 transitions. [2020-11-07 00:47:14,829 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 579 transitions. Word has length 73 [2020-11-07 00:47:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:14,829 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 579 transitions. [2020-11-07 00:47:14,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 579 transitions. [2020-11-07 00:47:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:47:14,831 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:14,831 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 00:47:14,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:47:14,831 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1544674994, now seen corresponding path program 1 times [2020-11-07 00:47:14,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:14,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860781059] [2020-11-07 00:47:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:14,835 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:14,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:14,922 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 00:47:14,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860781059] [2020-11-07 00:47:14,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:14,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:14,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329557462] [2020-11-07 00:47:14,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:14,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:14,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:14,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:14,927 INFO L87 Difference]: Start difference. First operand 436 states and 579 transitions. Second operand 4 states. [2020-11-07 00:47:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:15,329 INFO L93 Difference]: Finished difference Result 1192 states and 1614 transitions. [2020-11-07 00:47:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:15,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-11-07 00:47:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:15,335 INFO L225 Difference]: With dead ends: 1192 [2020-11-07 00:47:15,335 INFO L226 Difference]: Without dead ends: 801 [2020-11-07 00:47:15,338 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 00:47:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-11-07 00:47:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 800. [2020-11-07 00:47:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-11-07 00:47:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1063 transitions. [2020-11-07 00:47:15,498 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1063 transitions. Word has length 73 [2020-11-07 00:47:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:15,499 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1063 transitions. [2020-11-07 00:47:15,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1063 transitions. [2020-11-07 00:47:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 00:47:15,501 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:15,502 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 00:47:15,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:47:15,502 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:15,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1931575924, now seen corresponding path program 1 times [2020-11-07 00:47:15,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:15,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104503598] [2020-11-07 00:47:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:15,507 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:15,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:15,623 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 00:47:15,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104503598] [2020-11-07 00:47:15,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:15,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:15,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897601372] [2020-11-07 00:47:15,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:15,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:15,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:15,628 INFO L87 Difference]: Start difference. First operand 800 states and 1063 transitions. Second operand 4 states. [2020-11-07 00:47:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:16,060 INFO L93 Difference]: Finished difference Result 972 states and 1298 transitions. [2020-11-07 00:47:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:16,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-07 00:47:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:16,066 INFO L225 Difference]: With dead ends: 972 [2020-11-07 00:47:16,066 INFO L226 Difference]: Without dead ends: 969 [2020-11-07 00:47:16,068 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 00:47:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-11-07 00:47:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 800. [2020-11-07 00:47:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-11-07 00:47:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1055 transitions. [2020-11-07 00:47:16,204 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1055 transitions. Word has length 74 [2020-11-07 00:47:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:16,205 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1055 transitions. [2020-11-07 00:47:16,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1055 transitions. [2020-11-07 00:47:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 00:47:16,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:16,206 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 00:47:16,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:47:16,207 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash -632673779, now seen corresponding path program 1 times [2020-11-07 00:47:16,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:16,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180762780] [2020-11-07 00:47:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:16,211 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:16,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:16,280 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 00:47:16,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [180762780] [2020-11-07 00:47:16,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:16,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:16,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91364634] [2020-11-07 00:47:16,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:16,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:16,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:16,283 INFO L87 Difference]: Start difference. First operand 800 states and 1055 transitions. Second operand 4 states. [2020-11-07 00:47:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:16,790 INFO L93 Difference]: Finished difference Result 2260 states and 3010 transitions. [2020-11-07 00:47:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:16,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-07 00:47:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:16,799 INFO L225 Difference]: With dead ends: 2260 [2020-11-07 00:47:16,799 INFO L226 Difference]: Without dead ends: 1505 [2020-11-07 00:47:16,802 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 00:47:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-11-07 00:47:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1504. [2020-11-07 00:47:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-11-07 00:47:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1967 transitions. [2020-11-07 00:47:17,054 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1967 transitions. Word has length 74 [2020-11-07 00:47:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:17,055 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1967 transitions. [2020-11-07 00:47:17,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1967 transitions. [2020-11-07 00:47:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 00:47:17,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:17,057 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 00:47:17,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:47:17,058 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1018007220, now seen corresponding path program 1 times [2020-11-07 00:47:17,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:17,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461269119] [2020-11-07 00:47:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:17,061 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:17,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:17,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 00:47:17,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461269119] [2020-11-07 00:47:17,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:17,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:17,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769354920] [2020-11-07 00:47:17,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:17,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:17,128 INFO L87 Difference]: Start difference. First operand 1504 states and 1967 transitions. Second operand 4 states. [2020-11-07 00:47:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:17,629 INFO L93 Difference]: Finished difference Result 1812 states and 2370 transitions. [2020-11-07 00:47:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:17,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-07 00:47:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:17,640 INFO L225 Difference]: With dead ends: 1812 [2020-11-07 00:47:17,640 INFO L226 Difference]: Without dead ends: 1809 [2020-11-07 00:47:17,641 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 00:47:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2020-11-07 00:47:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1504. [2020-11-07 00:47:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-11-07 00:47:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1951 transitions. [2020-11-07 00:47:17,864 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1951 transitions. Word has length 75 [2020-11-07 00:47:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:17,865 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1951 transitions. [2020-11-07 00:47:17,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1951 transitions. [2020-11-07 00:47:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 00:47:17,867 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:17,867 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 00:47:17,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:47:17,867 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:17,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1869571642, now seen corresponding path program 1 times [2020-11-07 00:47:17,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:17,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705965005] [2020-11-07 00:47:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:17,871 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:17,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:17,947 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 00:47:17,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705965005] [2020-11-07 00:47:17,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:17,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:17,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924710210] [2020-11-07 00:47:17,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:17,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:17,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:17,950 INFO L87 Difference]: Start difference. First operand 1504 states and 1951 transitions. Second operand 4 states. [2020-11-07 00:47:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:18,711 INFO L93 Difference]: Finished difference Result 4324 states and 5634 transitions. [2020-11-07 00:47:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:18,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-07 00:47:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:18,727 INFO L225 Difference]: With dead ends: 4324 [2020-11-07 00:47:18,727 INFO L226 Difference]: Without dead ends: 2865 [2020-11-07 00:47:18,732 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 00:47:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-11-07 00:47:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2864. [2020-11-07 00:47:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2020-11-07 00:47:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3663 transitions. [2020-11-07 00:47:19,137 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3663 transitions. Word has length 75 [2020-11-07 00:47:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:19,137 INFO L481 AbstractCegarLoop]: Abstraction has 2864 states and 3663 transitions. [2020-11-07 00:47:19,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3663 transitions. [2020-11-07 00:47:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 00:47:19,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:19,141 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 00:47:19,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:47:19,141 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2129779897, now seen corresponding path program 1 times [2020-11-07 00:47:19,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:19,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1653844072] [2020-11-07 00:47:19,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:19,145 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:19,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:19,210 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 00:47:19,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1653844072] [2020-11-07 00:47:19,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:19,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:19,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780029684] [2020-11-07 00:47:19,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:19,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:19,213 INFO L87 Difference]: Start difference. First operand 2864 states and 3663 transitions. Second operand 4 states. [2020-11-07 00:47:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:20,297 INFO L93 Difference]: Finished difference Result 8308 states and 10642 transitions. [2020-11-07 00:47:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:20,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-11-07 00:47:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:20,328 INFO L225 Difference]: With dead ends: 8308 [2020-11-07 00:47:20,328 INFO L226 Difference]: Without dead ends: 5489 [2020-11-07 00:47:20,338 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 00:47:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2020-11-07 00:47:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5488. [2020-11-07 00:47:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 00:47:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6895 transitions. [2020-11-07 00:47:21,226 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6895 transitions. Word has length 76 [2020-11-07 00:47:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:21,226 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6895 transitions. [2020-11-07 00:47:21,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6895 transitions. [2020-11-07 00:47:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 00:47:21,233 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:21,233 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 00:47:21,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:47:21,234 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2034184296, now seen corresponding path program 1 times [2020-11-07 00:47:21,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:21,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079195015] [2020-11-07 00:47:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:21,242 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:21,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:21,306 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 00:47:21,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079195015] [2020-11-07 00:47:21,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:21,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:21,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885700271] [2020-11-07 00:47:21,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:21,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:21,309 INFO L87 Difference]: Start difference. First operand 5488 states and 6895 transitions. Second operand 4 states. [2020-11-07 00:47:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:22,534 INFO L93 Difference]: Finished difference Result 6516 states and 8114 transitions. [2020-11-07 00:47:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:22,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-11-07 00:47:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:22,562 INFO L225 Difference]: With dead ends: 6516 [2020-11-07 00:47:22,563 INFO L226 Difference]: Without dead ends: 6513 [2020-11-07 00:47:22,566 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 00:47:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2020-11-07 00:47:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5488. [2020-11-07 00:47:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 00:47:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6831 transitions. [2020-11-07 00:47:23,288 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6831 transitions. Word has length 76 [2020-11-07 00:47:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:23,288 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6831 transitions. [2020-11-07 00:47:23,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6831 transitions. [2020-11-07 00:47:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 00:47:23,292 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:23,293 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 00:47:23,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:47:23,297 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2132138048, now seen corresponding path program 1 times [2020-11-07 00:47:23,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:23,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1206423390] [2020-11-07 00:47:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:23,305 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:23,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:23,377 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 00:47:23,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1206423390] [2020-11-07 00:47:23,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:23,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:23,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727916397] [2020-11-07 00:47:23,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:23,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:23,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:23,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:23,382 INFO L87 Difference]: Start difference. First operand 5488 states and 6831 transitions. Second operand 4 states. [2020-11-07 00:47:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:24,686 INFO L93 Difference]: Finished difference Result 6452 states and 7922 transitions. [2020-11-07 00:47:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:24,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-07 00:47:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:24,714 INFO L225 Difference]: With dead ends: 6452 [2020-11-07 00:47:24,714 INFO L226 Difference]: Without dead ends: 6449 [2020-11-07 00:47:24,717 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 00:47:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6449 states. [2020-11-07 00:47:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6449 to 5488. [2020-11-07 00:47:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 00:47:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6767 transitions. [2020-11-07 00:47:25,503 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6767 transitions. Word has length 77 [2020-11-07 00:47:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:25,504 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6767 transitions. [2020-11-07 00:47:25,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6767 transitions. [2020-11-07 00:47:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 00:47:25,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:25,510 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 00:47:25,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:47:25,511 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1606312742, now seen corresponding path program 1 times [2020-11-07 00:47:25,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:25,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073717333] [2020-11-07 00:47:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:25,514 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:25,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:25,592 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 00:47:25,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073717333] [2020-11-07 00:47:25,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:25,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:25,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228456607] [2020-11-07 00:47:25,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:25,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:25,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:25,595 INFO L87 Difference]: Start difference. First operand 5488 states and 6767 transitions. Second operand 4 states. [2020-11-07 00:47:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:27,306 INFO L93 Difference]: Finished difference Result 15987 states and 19697 transitions. [2020-11-07 00:47:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:27,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-07 00:47:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:27,321 INFO L225 Difference]: With dead ends: 15987 [2020-11-07 00:47:27,321 INFO L226 Difference]: Without dead ends: 5488 [2020-11-07 00:47:27,345 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 00:47:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2020-11-07 00:47:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2020-11-07 00:47:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-11-07 00:47:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6511 transitions. [2020-11-07 00:47:27,928 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6511 transitions. Word has length 77 [2020-11-07 00:47:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:27,928 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6511 transitions. [2020-11-07 00:47:27,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6511 transitions. [2020-11-07 00:47:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 00:47:27,932 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:27,932 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 00:47:27,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:47:27,932 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:27,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1855843932, now seen corresponding path program 1 times [2020-11-07 00:47:27,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:27,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [709324574] [2020-11-07 00:47:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:27,935 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:27,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:28,077 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 00:47:28,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [709324574] [2020-11-07 00:47:28,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:28,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:28,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512766858] [2020-11-07 00:47:28,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:28,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:28,080 INFO L87 Difference]: Start difference. First operand 5488 states and 6511 transitions. Second operand 4 states. [2020-11-07 00:47:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:29,020 INFO L93 Difference]: Finished difference Result 5488 states and 6511 transitions. [2020-11-07 00:47:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:29,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-11-07 00:47:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:29,024 INFO L225 Difference]: With dead ends: 5488 [2020-11-07 00:47:29,024 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:47:29,039 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 00:47:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:47:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:47:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:47:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:47:29,040 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2020-11-07 00:47:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:29,040 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:47:29,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:47:29,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:47:29,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:47:29,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:47:31,535 WARN L194 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 00:47:31,828 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 39 [2020-11-07 00:47:33,681 WARN L194 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 00:47:34,968 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 00:47:35,076 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2020-11-07 00:47:35,338 WARN L194 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 85 [2020-11-07 00:47:35,485 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 55 [2020-11-07 00:47:35,957 WARN L194 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-11-07 00:47:36,094 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 53 [2020-11-07 00:47:37,063 WARN L194 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 783 DAG size of output: 31 [2020-11-07 00:47:37,225 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-11-07 00:47:37,469 WARN L194 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 85 [2020-11-07 00:47:37,826 WARN L194 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 499 DAG size of output: 31 [2020-11-07 00:47:38,064 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 65 [2020-11-07 00:47:38,207 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-11-07 00:47:38,592 WARN L194 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-11-07 00:47:39,098 WARN L194 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 189 [2020-11-07 00:47:39,436 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-11-07 00:47:39,541 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-11-07 00:47:40,492 WARN L194 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 769 DAG size of output: 31 [2020-11-07 00:47:40,820 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 53 [2020-11-07 00:47:41,113 WARN L194 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-11-07 00:47:41,489 WARN L194 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-11-07 00:47:41,700 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-11-07 00:47:43,056 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 00:47:43,843 WARN L194 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 45 [2020-11-07 00:47:44,206 WARN L194 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-11-07 00:47:44,359 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 65 [2020-11-07 00:47:45,539 WARN L194 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 00:47:46,295 WARN L194 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 743 DAG size of output: 31 [2020-11-07 00:47:46,865 WARN L194 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 189 [2020-11-07 00:47:46,995 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-11-07 00:47:47,452 WARN L194 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 121 [2020-11-07 00:47:48,829 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 798 DAG size of output: 39 [2020-11-07 00:47:49,933 WARN L194 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 791 DAG size of output: 31 [2020-11-07 00:47:50,860 WARN L194 SmtUtils]: Spent 925.00 ms on a formula simplification that was a NOOP. DAG size: 321 [2020-11-07 00:47:51,222 WARN L194 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 121 [2020-11-07 00:47:51,507 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-11-07 00:47:52,114 WARN L194 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 693 DAG size of output: 31 [2020-11-07 00:47:52,269 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-11-07 00:47:52,563 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-11-07 00:47:53,816 WARN L194 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-11-07 00:47:55,302 WARN L194 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:47:55,604 WARN L194 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:47:55,955 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:47:59,926 WARN L194 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 00:48:01,323 WARN L194 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:48:01,970 WARN L194 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:48:02,119 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:48:11,263 WARN L194 SmtUtils]: Spent 9.11 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 00:48:11,533 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:48:21,589 WARN L194 SmtUtils]: Spent 10.05 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-11-07 00:48:23,203 WARN L194 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 00:48:24,644 WARN L194 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:48:24,917 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:48:34,068 WARN L194 SmtUtils]: Spent 9.08 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 00:48:37,957 WARN L194 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 00:48:38,656 WARN L194 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:48:38,788 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 00:48:38,924 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 00:48:39,595 WARN L194 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:48:48,705 WARN L194 SmtUtils]: Spent 9.10 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 00:48:50,306 WARN L194 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 00:48:50,616 WARN L194 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:48:54,099 WARN L194 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 00:48:54,223 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 00:49:20,322 WARN L194 SmtUtils]: Spent 26.02 s on a formula simplification. DAG size of input: 311 DAG size of output: 291 [2020-11-07 00:49:23,834 WARN L194 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 00:49:24,438 WARN L194 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:49:25,133 WARN L194 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:49:25,279 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:49:28,795 WARN L194 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 00:49:38,811 WARN L194 SmtUtils]: Spent 10.01 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-11-07 00:49:38,820 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,821 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,821 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,821 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,821 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,821 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,821 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:49:38,821 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,822 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:49:38,822 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,822 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 00:49:38,822 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,822 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:49:38,822 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:49:38,823 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:49:38,823 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:49:38,823 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:49:38,823 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:49:38,824 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 00:49:38,825 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 00:49:38,825 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2020-11-07 00:49:38,825 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 00:49:38,825 INFO L269 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-11-07 00:49:38,825 INFO L269 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-11-07 00:49:38,825 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 00:49:38,826 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 00:49:38,826 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 00:49:38,826 INFO L262 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: false [2020-11-07 00:49:38,826 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 00:49:38,826 INFO L269 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-11-07 00:49:38,826 INFO L269 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: true [2020-11-07 00:49:38,827 INFO L269 CegarLoopResult]: At program point L36-2(line 36) the Hoare annotation is: true [2020-11-07 00:49:38,828 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 00:49:38,828 INFO L269 CegarLoopResult]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2020-11-07 00:49:38,828 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 00:49:38,830 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 00:49:38,831 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 00:49:38,831 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 00:49:38,831 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 00:49:38,832 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 00:49:38,832 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 00:49:38,832 INFO L262 CegarLoopResult]: At program point L136(line 136) the Hoare annotation is: false [2020-11-07 00:49:38,832 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 00:49:38,832 INFO L269 CegarLoopResult]: At program point L37(lines 37 39) the Hoare annotation is: true [2020-11-07 00:49:38,833 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 00:49:38,833 INFO L262 CegarLoopResult]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2020-11-07 00:49:38,833 INFO L262 CegarLoopResult]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2020-11-07 00:49:38,833 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 00:49:38,833 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 00:49:38,833 INFO L269 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-11-07 00:49:38,833 INFO L269 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-11-07 00:49:38,834 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 00:49:38,835 INFO L269 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-11-07 00:49:38,835 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 00:49:38,835 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 00:49:38,835 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 00:49:38,836 INFO L269 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-11-07 00:49:38,836 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2020-11-07 00:49:38,836 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 00:49:38,836 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 00:49:38,837 INFO L262 CegarLoopResult]: At program point L129(line 129) the Hoare annotation is: (= main_~lk8~0 1) [2020-11-07 00:49:38,837 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 00:49:38,837 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 00:49:38,837 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2020-11-07 00:49:38,837 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 00:49:38,837 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 00:49:38,837 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 00:49:38,837 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 00:49:38,838 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 00:49:38,838 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 00:49:38,838 INFO L269 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-11-07 00:49:38,839 INFO L269 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-11-07 00:49:38,839 INFO L269 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-11-07 00:49:38,839 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 00:49:38,839 INFO L269 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-11-07 00:49:38,839 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 00:49:38,839 INFO L269 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-11-07 00:49:38,840 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 00:49:38,840 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 00:49:38,840 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 00:49:38,842 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 00:49:38,842 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 00:49:38,842 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 00:49:38,842 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 00:49:38,843 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 00:49:38,843 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 00:49:38,843 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 00:49:38,844 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 00:49:38,844 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 00:49:38,844 INFO L269 CegarLoopResult]: At program point L58(lines 58 60) the Hoare annotation is: true [2020-11-07 00:49:38,844 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 00:49:38,845 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 00:49:38,845 INFO L269 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-11-07 00:49:38,845 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 00:49:38,845 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 00:49:38,845 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 00:49:38,845 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 00:49:38,846 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 00:49:38,846 INFO L269 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-11-07 00:49:38,846 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 00:49:38,846 INFO L269 CegarLoopResult]: At program point L133(lines 7 137) the Hoare annotation is: true [2020-11-07 00:49:38,846 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 00:49:38,846 INFO L269 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: true [2020-11-07 00:49:38,847 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 00:49:38,848 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 00:49:38,848 INFO L269 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-11-07 00:49:38,848 INFO L269 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-11-07 00:49:38,848 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 00:49:38,848 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 00:49:38,848 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 00:49:38,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:49:38 BoogieIcfgContainer [2020-11-07 00:49:38,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:49:38,862 INFO L168 Benchmark]: Toolchain (without parser) took 148602.62 ms. Allocated memory was 151.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 127.0 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. [2020-11-07 00:49:38,863 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:49:38,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.25 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 116.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:49:38,864 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 114.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:49:38,864 INFO L168 Benchmark]: RCFGBuilder took 625.17 ms. Allocated memory is still 151.0 MB. Free memory was 114.8 MB in the beginning and 123.8 MB in the end (delta: -9.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:49:38,865 INFO L168 Benchmark]: TraceAbstraction took 147647.85 ms. Allocated memory was 151.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 123.3 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. [2020-11-07 00:49:38,867 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.21 ms. Allocated memory is still 151.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 274.25 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 116.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.4 MB in the beginning and 114.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 625.17 ms. Allocated memory is still 151.0 MB. Free memory was 114.8 MB in the beginning and 123.8 MB in the end (delta: -9.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 147647.85 ms. Allocated memory was 151.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 123.3 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 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: 17.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 129.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2488 SDtfs, 2889 SDslu, 271 SDs, 0 SdLazy, 1790 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s 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.7s HoareSimplificationTime, 110 FomulaSimplificationsInter, 47378 FormulaSimplificationTreeSizeReductionInter, 104.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...