/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:11:50,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:11:50,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:11:50,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:11:50,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:11:50,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:11:50,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:11:50,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:11:50,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:11:50,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:11:50,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:11:50,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:11:50,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:11:50,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:11:50,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:11:50,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:11:50,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:11:50,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:11:50,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:11:50,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:11:50,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:11:50,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:11:50,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:11:50,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:11:50,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:11:50,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:11:50,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:11:50,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:11:50,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:11:50,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:11:50,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:11:50,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:11:50,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:11:50,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:11:50,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:11:50,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:11:50,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:11:50,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:11:50,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:11:50,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:11:50,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:11:50,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:11:50,436 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:11:50,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:11:50,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:11:50,442 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:11:50,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:11:50,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:11:50,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:11:50,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:11:50,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:11:50,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:11:50,444 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:11:50,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:11:50,445 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:11:50,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:11:50,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:11:50,445 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:11:50,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:11:50,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:11:50,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:11:50,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:11:50,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:11:50,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:11:50,447 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:11:50,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:11:50,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:11:50,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:11:50,913 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:11:50,913 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:11:50,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-11-07 05:11:50,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30f7bfbc/2870580746f54f2c844c104e02dfa8c7/FLAG0c035aa26 [2020-11-07 05:11:51,571 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:11:51,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-11-07 05:11:51,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30f7bfbc/2870580746f54f2c844c104e02dfa8c7/FLAG0c035aa26 [2020-11-07 05:11:51,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30f7bfbc/2870580746f54f2c844c104e02dfa8c7 [2020-11-07 05:11:51,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:11:51,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:11:51,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:11:51,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:11:51,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:11:51,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:51" (1/1) ... [2020-11-07 05:11:51,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623925c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:51, skipping insertion in model container [2020-11-07 05:11:51,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:51" (1/1) ... [2020-11-07 05:11:51,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:11:52,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:11:52,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:11:52,310 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:11:52,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:11:52,374 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:11:52,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52 WrapperNode [2020-11-07 05:11:52,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:11:52,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:11:52,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:11:52,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:11:52,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2020-11-07 05:11:52,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2020-11-07 05:11:52,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2020-11-07 05:11:52,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2020-11-07 05:11:52,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2020-11-07 05:11:52,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2020-11-07 05:11:52,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2020-11-07 05:11:52,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:11:52,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:11:52,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:11:52,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:11:52,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:11:52,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:11:52,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:11:52,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:11:52,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:11:52,509 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:11:52,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:11:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:11:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:11:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:11:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:11:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:11:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:11:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:11:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:11:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:11:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:11:53,116 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:11:53,116 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 05:11:53,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:53 BoogieIcfgContainer [2020-11-07 05:11:53,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:11:53,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:11:53,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:11:53,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:11:53,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:11:51" (1/3) ... [2020-11-07 05:11:53,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12984f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:53, skipping insertion in model container [2020-11-07 05:11:53,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (2/3) ... [2020-11-07 05:11:53,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12984f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:53, skipping insertion in model container [2020-11-07 05:11:53,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:53" (3/3) ... [2020-11-07 05:11:53,134 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-11-07 05:11:53,154 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:11:53,159 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:11:53,174 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:11:53,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:11:53,200 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:11:53,201 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:11:53,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:11:53,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:11:53,201 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:11:53,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:11:53,201 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:11:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-11-07 05:11:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 05:11:53,231 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:53,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:53,233 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1602311135, now seen corresponding path program 1 times [2020-11-07 05:11:53,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:53,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259559198] [2020-11-07 05:11:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:53,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:53,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259559198] [2020-11-07 05:11:53,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:53,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:53,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889190036] [2020-11-07 05:11:53,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:53,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:53,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:53,637 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 4 states. [2020-11-07 05:11:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:54,109 INFO L93 Difference]: Finished difference Result 203 states and 274 transitions. [2020-11-07 05:11:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:54,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-11-07 05:11:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:54,126 INFO L225 Difference]: With dead ends: 203 [2020-11-07 05:11:54,127 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 05:11:54,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 05:11:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2020-11-07 05:11:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 05:11:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2020-11-07 05:11:54,225 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 64 [2020-11-07 05:11:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:54,226 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2020-11-07 05:11:54,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2020-11-07 05:11:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:11:54,229 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:54,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:54,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:11:54,230 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash 179683855, now seen corresponding path program 1 times [2020-11-07 05:11:54,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:54,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143550781] [2020-11-07 05:11:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:54,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:54,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143550781] [2020-11-07 05:11:54,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:54,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:54,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759063501] [2020-11-07 05:11:54,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:54,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:54,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:54,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:54,405 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand 4 states. [2020-11-07 05:11:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:54,701 INFO L93 Difference]: Finished difference Result 163 states and 212 transitions. [2020-11-07 05:11:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:54,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-11-07 05:11:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:54,705 INFO L225 Difference]: With dead ends: 163 [2020-11-07 05:11:54,705 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 05:11:54,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 05:11:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2020-11-07 05:11:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 05:11:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2020-11-07 05:11:54,744 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 65 [2020-11-07 05:11:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:54,745 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2020-11-07 05:11:54,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2020-11-07 05:11:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:11:54,747 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:54,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:54,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:11:54,748 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1875549338, now seen corresponding path program 1 times [2020-11-07 05:11:54,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:54,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613094680] [2020-11-07 05:11:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:54,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:54,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613094680] [2020-11-07 05:11:54,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:54,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:54,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503311571] [2020-11-07 05:11:54,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:54,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:54,857 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand 4 states. [2020-11-07 05:11:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:55,149 INFO L93 Difference]: Finished difference Result 315 states and 425 transitions. [2020-11-07 05:11:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:55,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-11-07 05:11:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:55,152 INFO L225 Difference]: With dead ends: 315 [2020-11-07 05:11:55,152 INFO L226 Difference]: Without dead ends: 221 [2020-11-07 05:11:55,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-07 05:11:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2020-11-07 05:11:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-11-07 05:11:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 289 transitions. [2020-11-07 05:11:55,204 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 289 transitions. Word has length 65 [2020-11-07 05:11:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:55,204 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 289 transitions. [2020-11-07 05:11:55,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 289 transitions. [2020-11-07 05:11:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 05:11:55,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:55,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:55,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:11:55,207 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:55,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1979914163, now seen corresponding path program 1 times [2020-11-07 05:11:55,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:55,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488758072] [2020-11-07 05:11:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:55,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:55,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488758072] [2020-11-07 05:11:55,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:55,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:55,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356560201] [2020-11-07 05:11:55,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:55,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:55,297 INFO L87 Difference]: Start difference. First operand 220 states and 289 transitions. Second operand 4 states. [2020-11-07 05:11:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:55,623 INFO L93 Difference]: Finished difference Result 564 states and 768 transitions. [2020-11-07 05:11:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:55,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-07 05:11:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:55,627 INFO L225 Difference]: With dead ends: 564 [2020-11-07 05:11:55,627 INFO L226 Difference]: Without dead ends: 385 [2020-11-07 05:11:55,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-07 05:11:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2020-11-07 05:11:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-07 05:11:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 511 transitions. [2020-11-07 05:11:55,702 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 511 transitions. Word has length 66 [2020-11-07 05:11:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:55,702 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 511 transitions. [2020-11-07 05:11:55,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2020-11-07 05:11:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 05:11:55,704 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:55,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:55,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:11:55,705 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 476041895, now seen corresponding path program 1 times [2020-11-07 05:11:55,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:55,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229816205] [2020-11-07 05:11:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:55,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:55,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229816205] [2020-11-07 05:11:55,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:55,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:55,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81345721] [2020-11-07 05:11:55,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:55,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:55,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:55,797 INFO L87 Difference]: Start difference. First operand 384 states and 511 transitions. Second operand 4 states. [2020-11-07 05:11:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:56,115 INFO L93 Difference]: Finished difference Result 472 states and 634 transitions. [2020-11-07 05:11:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:56,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-07 05:11:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:56,120 INFO L225 Difference]: With dead ends: 472 [2020-11-07 05:11:56,120 INFO L226 Difference]: Without dead ends: 469 [2020-11-07 05:11:56,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-11-07 05:11:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 384. [2020-11-07 05:11:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-07 05:11:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 507 transitions. [2020-11-07 05:11:56,197 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 507 transitions. Word has length 66 [2020-11-07 05:11:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:56,197 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 507 transitions. [2020-11-07 05:11:56,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 507 transitions. [2020-11-07 05:11:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 05:11:56,199 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:56,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:56,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:11:56,200 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1073218075, now seen corresponding path program 1 times [2020-11-07 05:11:56,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:56,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [691815837] [2020-11-07 05:11:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:56,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:56,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [691815837] [2020-11-07 05:11:56,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:56,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:56,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663522926] [2020-11-07 05:11:56,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:56,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:56,284 INFO L87 Difference]: Start difference. First operand 384 states and 507 transitions. Second operand 4 states. [2020-11-07 05:11:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:56,612 INFO L93 Difference]: Finished difference Result 468 states and 622 transitions. [2020-11-07 05:11:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:56,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-11-07 05:11:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:56,615 INFO L225 Difference]: With dead ends: 468 [2020-11-07 05:11:56,616 INFO L226 Difference]: Without dead ends: 465 [2020-11-07 05:11:56,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-11-07 05:11:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 384. [2020-11-07 05:11:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-07 05:11:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 503 transitions. [2020-11-07 05:11:56,683 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 503 transitions. Word has length 67 [2020-11-07 05:11:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:56,683 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 503 transitions. [2020-11-07 05:11:56,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 503 transitions. [2020-11-07 05:11:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 05:11:56,685 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:56,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:56,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:11:56,685 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1240186874, now seen corresponding path program 1 times [2020-11-07 05:11:56,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:56,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123657796] [2020-11-07 05:11:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:56,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:56,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123657796] [2020-11-07 05:11:56,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:56,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:56,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575661578] [2020-11-07 05:11:56,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:56,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:56,756 INFO L87 Difference]: Start difference. First operand 384 states and 503 transitions. Second operand 4 states. [2020-11-07 05:11:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:57,146 INFO L93 Difference]: Finished difference Result 1044 states and 1394 transitions. [2020-11-07 05:11:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:57,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-11-07 05:11:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:57,151 INFO L225 Difference]: With dead ends: 1044 [2020-11-07 05:11:57,151 INFO L226 Difference]: Without dead ends: 701 [2020-11-07 05:11:57,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-11-07 05:11:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2020-11-07 05:11:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-11-07 05:11:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 915 transitions. [2020-11-07 05:11:57,282 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 915 transitions. Word has length 67 [2020-11-07 05:11:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:57,282 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 915 transitions. [2020-11-07 05:11:57,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 915 transitions. [2020-11-07 05:11:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 05:11:57,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:57,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:57,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:11:57,285 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1889145293, now seen corresponding path program 1 times [2020-11-07 05:11:57,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:57,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157839732] [2020-11-07 05:11:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:57,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:57,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157839732] [2020-11-07 05:11:57,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:57,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:57,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87981746] [2020-11-07 05:11:57,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:57,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:57,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:57,356 INFO L87 Difference]: Start difference. First operand 700 states and 915 transitions. Second operand 4 states. [2020-11-07 05:11:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:57,795 INFO L93 Difference]: Finished difference Result 848 states and 1110 transitions. [2020-11-07 05:11:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:57,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-11-07 05:11:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:57,801 INFO L225 Difference]: With dead ends: 848 [2020-11-07 05:11:57,801 INFO L226 Difference]: Without dead ends: 845 [2020-11-07 05:11:57,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-11-07 05:11:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 700. [2020-11-07 05:11:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-11-07 05:11:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 907 transitions. [2020-11-07 05:11:57,913 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 907 transitions. Word has length 68 [2020-11-07 05:11:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:57,913 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 907 transitions. [2020-11-07 05:11:57,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 907 transitions. [2020-11-07 05:11:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 05:11:57,914 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:57,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:57,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:11:57,915 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash 216534137, now seen corresponding path program 1 times [2020-11-07 05:11:57,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:57,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107588747] [2020-11-07 05:11:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:57,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:57,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107588747] [2020-11-07 05:11:57,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:57,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:57,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606330483] [2020-11-07 05:11:57,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:57,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:57,999 INFO L87 Difference]: Start difference. First operand 700 states and 907 transitions. Second operand 4 states. [2020-11-07 05:11:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:58,510 INFO L93 Difference]: Finished difference Result 1968 states and 2574 transitions. [2020-11-07 05:11:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:58,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-11-07 05:11:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:58,519 INFO L225 Difference]: With dead ends: 1968 [2020-11-07 05:11:58,519 INFO L226 Difference]: Without dead ends: 1309 [2020-11-07 05:11:58,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2020-11-07 05:11:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1308. [2020-11-07 05:11:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-11-07 05:11:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1675 transitions. [2020-11-07 05:11:58,710 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1675 transitions. Word has length 68 [2020-11-07 05:11:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:58,711 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1675 transitions. [2020-11-07 05:11:58,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1675 transitions. [2020-11-07 05:11:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-07 05:11:58,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:58,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:58,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:11:58,714 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash 766882343, now seen corresponding path program 1 times [2020-11-07 05:11:58,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:58,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [159040966] [2020-11-07 05:11:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:58,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:58,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [159040966] [2020-11-07 05:11:58,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:58,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:58,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823096427] [2020-11-07 05:11:58,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:58,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:58,778 INFO L87 Difference]: Start difference. First operand 1308 states and 1675 transitions. Second operand 4 states. [2020-11-07 05:11:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:11:59,288 INFO L93 Difference]: Finished difference Result 1568 states and 1998 transitions. [2020-11-07 05:11:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:11:59,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-11-07 05:11:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:11:59,298 INFO L225 Difference]: With dead ends: 1568 [2020-11-07 05:11:59,298 INFO L226 Difference]: Without dead ends: 1565 [2020-11-07 05:11:59,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:11:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2020-11-07 05:11:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1308. [2020-11-07 05:11:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-11-07 05:11:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1659 transitions. [2020-11-07 05:11:59,474 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1659 transitions. Word has length 69 [2020-11-07 05:11:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:11:59,474 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1659 transitions. [2020-11-07 05:11:59,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:11:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1659 transitions. [2020-11-07 05:11:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-07 05:11:59,477 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:11:59,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:11:59,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:11:59,477 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:11:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:11:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1869743246, now seen corresponding path program 1 times [2020-11-07 05:11:59,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:11:59,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [720263284] [2020-11-07 05:11:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:11:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:59,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:11:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:11:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:11:59,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [720263284] [2020-11-07 05:11:59,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:11:59,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:11:59,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885103987] [2020-11-07 05:11:59,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:11:59,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:11:59,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:11:59,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:11:59,565 INFO L87 Difference]: Start difference. First operand 1308 states and 1659 transitions. Second operand 4 states. [2020-11-07 05:12:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:00,291 INFO L93 Difference]: Finished difference Result 3744 states and 4766 transitions. [2020-11-07 05:12:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:00,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-11-07 05:12:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:00,305 INFO L225 Difference]: With dead ends: 3744 [2020-11-07 05:12:00,305 INFO L226 Difference]: Without dead ends: 2477 [2020-11-07 05:12:00,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2020-11-07 05:12:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2476. [2020-11-07 05:12:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-11-07 05:12:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3083 transitions. [2020-11-07 05:12:00,734 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3083 transitions. Word has length 69 [2020-11-07 05:12:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:00,735 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3083 transitions. [2020-11-07 05:12:00,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3083 transitions. [2020-11-07 05:12:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 05:12:00,738 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:00,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:00,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:12:00,739 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:00,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1499371967, now seen corresponding path program 1 times [2020-11-07 05:12:00,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:00,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [744755686] [2020-11-07 05:12:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:00,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:00,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [744755686] [2020-11-07 05:12:00,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:00,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:00,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948387901] [2020-11-07 05:12:00,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:00,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:00,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:00,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:00,910 INFO L87 Difference]: Start difference. First operand 2476 states and 3083 transitions. Second operand 4 states. [2020-11-07 05:12:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:01,855 INFO L93 Difference]: Finished difference Result 2928 states and 3598 transitions. [2020-11-07 05:12:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:01,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-11-07 05:12:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:01,873 INFO L225 Difference]: With dead ends: 2928 [2020-11-07 05:12:01,873 INFO L226 Difference]: Without dead ends: 2925 [2020-11-07 05:12:01,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-11-07 05:12:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2476. [2020-11-07 05:12:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-11-07 05:12:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3051 transitions. [2020-11-07 05:12:02,381 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3051 transitions. Word has length 70 [2020-11-07 05:12:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:02,381 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3051 transitions. [2020-11-07 05:12:02,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3051 transitions. [2020-11-07 05:12:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 05:12:02,385 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:02,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:02,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:12:02,385 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2119821147, now seen corresponding path program 1 times [2020-11-07 05:12:02,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:02,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [668760873] [2020-11-07 05:12:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:02,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:02,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [668760873] [2020-11-07 05:12:02,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:02,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:02,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195075043] [2020-11-07 05:12:02,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:02,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:02,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:02,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:02,483 INFO L87 Difference]: Start difference. First operand 2476 states and 3051 transitions. Second operand 4 states. [2020-11-07 05:12:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:03,429 INFO L93 Difference]: Finished difference Result 7151 states and 8813 transitions. [2020-11-07 05:12:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:03,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-11-07 05:12:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:03,444 INFO L225 Difference]: With dead ends: 7151 [2020-11-07 05:12:03,444 INFO L226 Difference]: Without dead ends: 2476 [2020-11-07 05:12:03,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2020-11-07 05:12:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2020-11-07 05:12:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-11-07 05:12:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 2923 transitions. [2020-11-07 05:12:03,902 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 2923 transitions. Word has length 70 [2020-11-07 05:12:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:03,903 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 2923 transitions. [2020-11-07 05:12:03,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 2923 transitions. [2020-11-07 05:12:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 05:12:03,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:12:03,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:12:03,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:12:03,907 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:12:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:12:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1563241933, now seen corresponding path program 1 times [2020-11-07 05:12:03,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:12:03,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011359143] [2020-11-07 05:12:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:12:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:03,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:12:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:12:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:12:04,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011359143] [2020-11-07 05:12:04,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:12:04,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:12:04,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242920169] [2020-11-07 05:12:04,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:12:04,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:12:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:12:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:12:04,012 INFO L87 Difference]: Start difference. First operand 2476 states and 2923 transitions. Second operand 4 states. [2020-11-07 05:12:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:12:04,528 INFO L93 Difference]: Finished difference Result 2476 states and 2923 transitions. [2020-11-07 05:12:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:12:04,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-11-07 05:12:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:12:04,530 INFO L225 Difference]: With dead ends: 2476 [2020-11-07 05:12:04,530 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:12:04,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:12:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:12:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:12:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:12:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:12:04,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2020-11-07 05:12:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:12:04,538 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:12:04,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:12:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:12:04,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:12:04,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:12:04,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:12:04,830 WARN L194 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2020-11-07 05:12:05,129 WARN L194 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2020-11-07 05:12:05,964 WARN L194 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 05:12:06,601 WARN L194 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 05:12:07,102 WARN L194 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 05:12:07,571 WARN L194 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 05:12:08,108 WARN L194 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-11-07 05:12:08,293 WARN L194 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 85 [2020-11-07 05:12:08,593 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-11-07 05:12:08,946 WARN L194 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2020-11-07 05:12:09,158 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-11-07 05:12:09,353 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 65 [2020-11-07 05:12:09,536 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 34 [2020-11-07 05:12:09,947 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2020-11-07 05:12:10,069 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 53 [2020-11-07 05:12:10,190 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-11-07 05:12:10,371 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-11-07 05:12:10,494 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-11-07 05:12:10,865 WARN L194 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 05:12:11,058 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 45 [2020-11-07 05:12:11,160 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 34 [2020-11-07 05:12:11,425 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 05:12:11,585 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2020-11-07 05:12:12,227 WARN L194 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 39 [2020-11-07 05:12:12,528 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 31 [2020-11-07 05:12:12,738 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2020-11-07 05:12:14,367 WARN L194 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:12:23,621 WARN L194 SmtUtils]: Spent 9.16 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 05:12:25,089 WARN L194 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:12:25,358 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:12:25,670 WARN L194 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:12:27,172 WARN L194 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 05:12:31,089 WARN L194 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 05:12:31,704 WARN L194 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:12:31,855 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:12:31,995 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:12:33,624 WARN L194 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 05:12:34,233 WARN L194 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:12:34,506 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:12:38,111 WARN L194 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 05:12:38,234 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:12:42,181 WARN L194 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 05:12:42,883 WARN L194 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:12:43,532 WARN L194 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 05:12:43,655 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 05:12:47,232 WARN L194 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 05:12:48,847 WARN L194 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 05:12:49,161 WARN L194 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 05:12:49,559 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 05:12:53,090 WARN L194 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 05:12:53,790 WARN L194 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 05:12:53,937 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 05:12:53,943 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,943 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,944 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,944 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,944 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,944 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,944 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:12:53,944 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,944 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:12:53,945 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:12:53,946 INFO L262 CegarLoopResult]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse0 .cse7 .cse2) (and .cse6 .cse2 .cse4 .cse3) (and .cse5 .cse7 .cse1 .cse4) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2020-11-07 05:12:53,946 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 05:12:53,946 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2020-11-07 05:12:53,947 INFO L262 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-11-07 05:12:53,947 INFO L262 CegarLoopResult]: At program point L110(line 110) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-11-07 05:12:53,948 INFO L262 CegarLoopResult]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2020-11-07 05:12:53,948 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 05:12:53,948 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 05:12:53,949 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 05:12:53,949 INFO L262 CegarLoopResult]: At program point L69-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-11-07 05:12:53,949 INFO L262 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-11-07 05:12:53,949 INFO L262 CegarLoopResult]: At program point L61-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 05:12:53,950 INFO L269 CegarLoopResult]: At program point L119(lines 7 123) the Hoare annotation is: true [2020-11-07 05:12:53,950 INFO L269 CegarLoopResult]: At program point L53(lines 53 55) the Hoare annotation is: true [2020-11-07 05:12:53,950 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 05:12:53,950 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 05:12:53,950 INFO L262 CegarLoopResult]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:12:53,950 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 05:12:53,951 INFO L262 CegarLoopResult]: At program point L78(line 78) 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 .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (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 .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (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 .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .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 .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-11-07 05:12:53,951 INFO L269 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-11-07 05:12:53,951 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 05:12:53,951 INFO L262 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 05:12:53,951 INFO L262 CegarLoopResult]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2020-11-07 05:12:53,951 INFO L269 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-11-07 05:12:53,952 INFO L262 CegarLoopResult]: At program point L95(line 95) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-11-07 05:12:53,952 INFO L262 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 05:12:53,952 INFO L269 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-11-07 05:12:53,952 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 05:12:53,952 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2020-11-07 05:12:53,952 INFO L262 CegarLoopResult]: At program point L104(line 104) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-11-07 05:12:53,952 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 05:12:53,952 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2020-11-07 05:12:53,952 INFO L262 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: false [2020-11-07 05:12:53,953 INFO L262 CegarLoopResult]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2020-11-07 05:12:53,953 INFO L269 CegarLoopResult]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2020-11-07 05:12:53,953 INFO L269 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-11-07 05:12:53,953 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 05:12:53,953 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 05:12:53,953 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 05:12:53,954 INFO L262 CegarLoopResult]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-11-07 05:12:53,954 INFO L269 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-11-07 05:12:53,954 INFO L262 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: false [2020-11-07 05:12:53,954 INFO L262 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-11-07 05:12:53,954 INFO L269 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-11-07 05:12:53,955 INFO L269 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-11-07 05:12:53,955 INFO L269 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-11-07 05:12:53,955 INFO L262 CegarLoopResult]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2020-11-07 05:12:53,955 INFO L262 CegarLoopResult]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2020-11-07 05:12:53,955 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 05:12:53,956 INFO L262 CegarLoopResult]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-11-07 05:12:53,956 INFO L262 CegarLoopResult]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2020-11-07 05:12:53,956 INFO L262 CegarLoopResult]: At program point L65-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-11-07 05:12:53,957 INFO L262 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-11-07 05:12:53,957 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 05:12:53,957 INFO L262 CegarLoopResult]: At program point L57-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-11-07 05:12:53,957 INFO L262 CegarLoopResult]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2020-11-07 05:12:53,957 INFO L269 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-11-07 05:12:53,958 INFO L262 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-11-07 05:12:53,958 INFO L269 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-11-07 05:12:53,958 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 05:12:53,958 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 05:12:53,958 INFO L262 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2020-11-07 05:12:53,958 INFO L262 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-11-07 05:12:53,959 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 05:12:53,959 INFO L269 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-11-07 05:12:53,959 INFO L269 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-11-07 05:12:53,959 INFO L262 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 05:12:53,960 INFO L262 CegarLoopResult]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse1 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse8 .cse6 .cse0 .cse3 .cse5 .cse11) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse11 .cse10) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse11) (and .cse8 .cse6 .cse3 .cse7 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse1 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse3 .cse4 .cse5 .cse11) (and .cse6 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse6 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse8 .cse1 .cse3 .cse7 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse3 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse11 .cse10) (and .cse6 .cse0 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse3 .cse11) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse9 .cse4 .cse11 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse1 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse0 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-11-07 05:12:53,960 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 05:12:53,960 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 05:12:53,960 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 05:12:53,960 INFO L262 CegarLoopResult]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2020-11-07 05:12:53,960 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 05:12:53,960 INFO L262 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2020-11-07 05:12:53,961 INFO L269 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: true [2020-11-07 05:12:53,961 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 05:12:53,961 INFO L269 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-11-07 05:12:53,961 INFO L269 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-11-07 05:12:53,962 INFO L262 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-11-07 05:12:53,962 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 05:12:53,962 INFO L262 CegarLoopResult]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-11-07 05:12:53,962 INFO L269 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-11-07 05:12:53,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:12:53 BoogieIcfgContainer [2020-11-07 05:12:53,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:12:53,977 INFO L168 Benchmark]: Toolchain (without parser) took 62021.50 ms. Allocated memory was 157.3 MB in the beginning and 1.1 GB in the end (delta: 987.8 MB). Free memory was 132.7 MB in the beginning and 603.4 MB in the end (delta: -470.7 MB). Peak memory consumption was 722.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:53,977 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory is still 100.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:12:53,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.55 ms. Allocated memory is still 157.3 MB. Free memory was 132.1 MB in the beginning and 122.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:53,978 INFO L168 Benchmark]: Boogie Preprocessor took 36.94 ms. Allocated memory is still 157.3 MB. Free memory was 122.2 MB in the beginning and 120.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:53,979 INFO L168 Benchmark]: RCFGBuilder took 705.22 ms. Allocated memory is still 157.3 MB. Free memory was 120.5 MB in the beginning and 122.0 MB in the end (delta: -1.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:53,980 INFO L168 Benchmark]: TraceAbstraction took 60851.47 ms. Allocated memory was 157.3 MB in the beginning and 1.1 GB in the end (delta: 987.8 MB). Free memory was 121.6 MB in the beginning and 603.4 MB in the end (delta: -481.8 MB). Peak memory consumption was 710.9 MB. Max. memory is 8.0 GB. [2020-11-07 05:12:53,982 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 125.8 MB. Free memory is still 100.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 404.55 ms. Allocated memory is still 157.3 MB. Free memory was 132.1 MB in the beginning and 122.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.94 ms. Allocated memory is still 157.3 MB. Free memory was 122.2 MB in the beginning and 120.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 705.22 ms. Allocated memory is still 157.3 MB. Free memory was 120.5 MB in the beginning and 122.0 MB in the end (delta: -1.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 60851.47 ms. Allocated memory was 157.3 MB in the beginning and 1.1 GB in the end (delta: 987.8 MB). Free memory was 121.6 MB in the beginning and 603.4 MB in the end (delta: -481.8 MB). Peak memory consumption was 710.9 MB. 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: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: 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, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 49.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1939 SDtfs, 2220 SDslu, 237 SDs, 0 SdLazy, 1392 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2476occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 100 LocationsWithAnnotation, 152 PreInvPairs, 4832 NumberOfFragments, 13960 HoareAnnotationTreeSize, 152 FomulaSimplifications, 1343345 FormulaSimplificationTreeSizeReduction, 8.3s HoareSimplificationTime, 100 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 41.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 103873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...