/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-23 18:00:21,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 18:00:21,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 18:00:21,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 18:00:21,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 18:00:21,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 18:00:21,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 18:00:21,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 18:00:21,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 18:00:21,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 18:00:21,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 18:00:21,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 18:00:21,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 18:00:21,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 18:00:21,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 18:00:21,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 18:00:21,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 18:00:21,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 18:00:21,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 18:00:21,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 18:00:21,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 18:00:21,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 18:00:21,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 18:00:21,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 18:00:21,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 18:00:21,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 18:00:21,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 18:00:21,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 18:00:21,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 18:00:21,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 18:00:21,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 18:00:21,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 18:00:21,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 18:00:21,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 18:00:21,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 18:00:21,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 18:00:21,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 18:00:21,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 18:00:21,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 18:00:21,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 18:00:21,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 18:00:21,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-23 18:00:21,639 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 18:00:21,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 18:00:21,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 18:00:21,645 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 18:00:21,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 18:00:21,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 18:00:21,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 18:00:21,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 18:00:21,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 18:00:21,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 18:00:21,648 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 18:00:21,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 18:00:21,649 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 18:00:21,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 18:00:21,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 18:00:21,650 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-23 18:00:21,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-23 18:00:21,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 18:00:21,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 18:00:21,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 18:00:21,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-23 18:00:21,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 18:00:21,651 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 [2021-02-23 18:00:22,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 18:00:22,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 18:00:22,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 18:00:22,126 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 18:00:22,129 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 18:00:22,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2021-02-23 18:00:22,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71235bd7d/c17865444b93493a89182d2049ab2ead/FLAG66215a805 [2021-02-23 18:00:22,981 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 18:00:22,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2021-02-23 18:00:22,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71235bd7d/c17865444b93493a89182d2049ab2ead/FLAG66215a805 [2021-02-23 18:00:23,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71235bd7d/c17865444b93493a89182d2049ab2ead [2021-02-23 18:00:23,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 18:00:23,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 18:00:23,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 18:00:23,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 18:00:23,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 18:00:23,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@877b5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23, skipping insertion in model container [2021-02-23 18:00:23,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 18:00:23,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 18:00:23,549 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2021-02-23 18:00:23,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 18:00:23,568 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 18:00:23,618 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2021-02-23 18:00:23,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 18:00:23,642 INFO L208 MainTranslator]: Completed translation [2021-02-23 18:00:23,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23 WrapperNode [2021-02-23 18:00:23,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 18:00:23,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 18:00:23,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 18:00:23,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 18:00:23,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (1/1) ... [2021-02-23 18:00:23,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 18:00:23,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 18:00:23,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 18:00:23,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 18:00:23,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (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 [2021-02-23 18:00:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 18:00:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 18:00:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 18:00:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 18:00:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 18:00:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 18:00:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 18:00:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 18:00:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-23 18:00:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 18:00:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 18:00:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 18:00:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 18:00:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 18:00:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 18:00:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 18:00:24,400 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 18:00:24,401 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-02-23 18:00:24,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:00:24 BoogieIcfgContainer [2021-02-23 18:00:24,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 18:00:24,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 18:00:24,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 18:00:24,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 18:00:24,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 06:00:23" (1/3) ... [2021-02-23 18:00:24,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b608500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:00:24, skipping insertion in model container [2021-02-23 18:00:24,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:00:23" (2/3) ... [2021-02-23 18:00:24,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b608500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:00:24, skipping insertion in model container [2021-02-23 18:00:24,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:00:24" (3/3) ... [2021-02-23 18:00:24,435 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2021-02-23 18:00:24,445 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-23 18:00:24,452 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 18:00:24,479 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 18:00:24,527 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 18:00:24,527 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 18:00:24,528 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-23 18:00:24,528 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 18:00:24,528 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 18:00:24,528 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 18:00:24,528 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 18:00:24,528 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 18:00:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2021-02-23 18:00:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-02-23 18:00:24,582 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:24,584 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] [2021-02-23 18:00:24,585 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash -734651465, now seen corresponding path program 1 times [2021-02-23 18:00:24,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:24,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520031789] [2021-02-23 18:00:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:24,722 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:24,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:24,942 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:24,945 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:24,946 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:24,965 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:24,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:25,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:25,039 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:25,040 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:25,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520031789] [2021-02-23 18:00:25,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:25,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:25,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722479200] [2021-02-23 18:00:25,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:25,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:25,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:25,093 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2021-02-23 18:00:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:25,718 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2021-02-23 18:00:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:25,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-02-23 18:00:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:25,735 INFO L225 Difference]: With dead ends: 200 [2021-02-23 18:00:25,735 INFO L226 Difference]: Without dead ends: 136 [2021-02-23 18:00:25,740 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 [2021-02-23 18:00:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-02-23 18:00:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2021-02-23 18:00:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-23 18:00:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2021-02-23 18:00:25,837 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 63 [2021-02-23 18:00:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:25,838 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2021-02-23 18:00:25,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2021-02-23 18:00:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-23 18:00:25,841 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:25,841 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] [2021-02-23 18:00:25,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 18:00:25,842 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -106893304, now seen corresponding path program 1 times [2021-02-23 18:00:25,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:25,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793253513] [2021-02-23 18:00:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:25,847 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:25,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:25,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:25,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:25,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:25,922 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:25,923 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:25,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:25,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:25,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:25,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793253513] [2021-02-23 18:00:25,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:25,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:25,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405679644] [2021-02-23 18:00:25,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:25,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:25,978 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand 4 states. [2021-02-23 18:00:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:26,303 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2021-02-23 18:00:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:26,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-23 18:00:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:26,306 INFO L225 Difference]: With dead ends: 162 [2021-02-23 18:00:26,307 INFO L226 Difference]: Without dead ends: 160 [2021-02-23 18:00:26,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 [2021-02-23 18:00:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-02-23 18:00:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2021-02-23 18:00:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-23 18:00:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2021-02-23 18:00:26,350 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 64 [2021-02-23 18:00:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:26,351 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2021-02-23 18:00:26,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2021-02-23 18:00:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-23 18:00:26,353 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:26,354 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] [2021-02-23 18:00:26,354 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 18:00:26,354 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:26,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:26,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1299113955, now seen corresponding path program 1 times [2021-02-23 18:00:26,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:26,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1365713214] [2021-02-23 18:00:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:26,373 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:26,427 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:26,428 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:26,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:26,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:26,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:26,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:26,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:26,489 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:26,491 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:26,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1365713214] [2021-02-23 18:00:26,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:26,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:26,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111692332] [2021-02-23 18:00:26,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:26,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:26,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:26,506 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand 4 states. [2021-02-23 18:00:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:26,775 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2021-02-23 18:00:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:26,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-23 18:00:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:26,779 INFO L225 Difference]: With dead ends: 314 [2021-02-23 18:00:26,779 INFO L226 Difference]: Without dead ends: 221 [2021-02-23 18:00:26,780 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 [2021-02-23 18:00:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-02-23 18:00:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2021-02-23 18:00:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-23 18:00:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2021-02-23 18:00:26,850 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 64 [2021-02-23 18:00:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:26,851 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2021-02-23 18:00:26,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2021-02-23 18:00:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-23 18:00:26,858 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:26,858 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] [2021-02-23 18:00:26,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 18:00:26,859 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash -429978543, now seen corresponding path program 1 times [2021-02-23 18:00:26,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:26,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373235102] [2021-02-23 18:00:26,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:26,867 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:26,962 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:26,965 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:26,968 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:26,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:26,975 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:26,976 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:27,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:27,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373235102] [2021-02-23 18:00:27,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:27,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:27,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036312687] [2021-02-23 18:00:27,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:27,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:27,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:27,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:27,031 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand 4 states. [2021-02-23 18:00:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:27,293 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2021-02-23 18:00:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:27,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-23 18:00:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:27,296 INFO L225 Difference]: With dead ends: 267 [2021-02-23 18:00:27,296 INFO L226 Difference]: Without dead ends: 265 [2021-02-23 18:00:27,297 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 [2021-02-23 18:00:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-02-23 18:00:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2021-02-23 18:00:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-23 18:00:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 286 transitions. [2021-02-23 18:00:27,340 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 286 transitions. Word has length 65 [2021-02-23 18:00:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:27,340 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 286 transitions. [2021-02-23 18:00:27,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 286 transitions. [2021-02-23 18:00:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-23 18:00:27,342 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:27,342 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] [2021-02-23 18:00:27,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 18:00:27,343 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:27,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1617581589, now seen corresponding path program 1 times [2021-02-23 18:00:27,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:27,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354832111] [2021-02-23 18:00:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:27,346 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:27,382 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,383 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,384 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,384 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:27,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,388 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:27,417 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,418 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:27,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354832111] [2021-02-23 18:00:27,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:27,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:27,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972258780] [2021-02-23 18:00:27,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:27,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:27,426 INFO L87 Difference]: Start difference. First operand 219 states and 286 transitions. Second operand 4 states. [2021-02-23 18:00:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:27,718 INFO L93 Difference]: Finished difference Result 563 states and 760 transitions. [2021-02-23 18:00:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:27,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-23 18:00:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:27,721 INFO L225 Difference]: With dead ends: 563 [2021-02-23 18:00:27,722 INFO L226 Difference]: Without dead ends: 385 [2021-02-23 18:00:27,723 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 [2021-02-23 18:00:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-02-23 18:00:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2021-02-23 18:00:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-23 18:00:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 506 transitions. [2021-02-23 18:00:27,804 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 506 transitions. Word has length 65 [2021-02-23 18:00:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:27,805 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 506 transitions. [2021-02-23 18:00:27,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2021-02-23 18:00:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-23 18:00:27,806 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:27,806 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] [2021-02-23 18:00:27,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 18:00:27,807 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1855685988, now seen corresponding path program 1 times [2021-02-23 18:00:27,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:27,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575534060] [2021-02-23 18:00:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:27,810 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:27,840 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,842 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,842 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:27,846 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,846 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:27,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:27,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:27,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575534060] [2021-02-23 18:00:27,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:27,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:27,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086785689] [2021-02-23 18:00:27,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:27,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:27,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:27,885 INFO L87 Difference]: Start difference. First operand 383 states and 506 transitions. Second operand 4 states. [2021-02-23 18:00:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:28,171 INFO L93 Difference]: Finished difference Result 467 states and 620 transitions. [2021-02-23 18:00:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:28,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-23 18:00:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:28,175 INFO L225 Difference]: With dead ends: 467 [2021-02-23 18:00:28,175 INFO L226 Difference]: Without dead ends: 465 [2021-02-23 18:00:28,176 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 [2021-02-23 18:00:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-02-23 18:00:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2021-02-23 18:00:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-23 18:00:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 502 transitions. [2021-02-23 18:00:28,271 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 502 transitions. Word has length 66 [2021-02-23 18:00:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:28,271 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 502 transitions. [2021-02-23 18:00:28,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 502 transitions. [2021-02-23 18:00:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-23 18:00:28,272 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:28,273 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] [2021-02-23 18:00:28,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 18:00:28,273 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1394824017, now seen corresponding path program 1 times [2021-02-23 18:00:28,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:28,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302723273] [2021-02-23 18:00:28,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:28,277 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:28,309 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,310 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:28,311 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,311 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:28,315 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,315 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:28,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:28,346 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,346 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:28,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302723273] [2021-02-23 18:00:28,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:28,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:28,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973457366] [2021-02-23 18:00:28,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:28,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:28,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:28,355 INFO L87 Difference]: Start difference. First operand 383 states and 502 transitions. Second operand 4 states. [2021-02-23 18:00:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:28,705 INFO L93 Difference]: Finished difference Result 1043 states and 1392 transitions. [2021-02-23 18:00:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:28,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-23 18:00:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:28,710 INFO L225 Difference]: With dead ends: 1043 [2021-02-23 18:00:28,710 INFO L226 Difference]: Without dead ends: 701 [2021-02-23 18:00:28,712 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 [2021-02-23 18:00:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-02-23 18:00:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 699. [2021-02-23 18:00:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-23 18:00:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2021-02-23 18:00:28,844 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 66 [2021-02-23 18:00:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:28,844 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2021-02-23 18:00:28,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2021-02-23 18:00:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-23 18:00:28,846 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:28,846 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] [2021-02-23 18:00:28,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 18:00:28,846 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1192023845, now seen corresponding path program 1 times [2021-02-23 18:00:28,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:28,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [567622325] [2021-02-23 18:00:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:28,850 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:28,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:28,875 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,875 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:28,878 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,879 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:28,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:28,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:28,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:28,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [567622325] [2021-02-23 18:00:28,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:28,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:28,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642969998] [2021-02-23 18:00:28,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:28,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:28,917 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand 4 states. [2021-02-23 18:00:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:29,296 INFO L93 Difference]: Finished difference Result 847 states and 1108 transitions. [2021-02-23 18:00:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:29,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-23 18:00:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:29,308 INFO L225 Difference]: With dead ends: 847 [2021-02-23 18:00:29,309 INFO L226 Difference]: Without dead ends: 845 [2021-02-23 18:00:29,310 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 [2021-02-23 18:00:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-02-23 18:00:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 699. [2021-02-23 18:00:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-23 18:00:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 906 transitions. [2021-02-23 18:00:29,431 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 906 transitions. Word has length 67 [2021-02-23 18:00:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:29,432 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 906 transitions. [2021-02-23 18:00:29,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 906 transitions. [2021-02-23 18:00:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-23 18:00:29,439 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:29,439 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] [2021-02-23 18:00:29,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 18:00:29,440 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 290117663, now seen corresponding path program 1 times [2021-02-23 18:00:29,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:29,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590523761] [2021-02-23 18:00:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:29,443 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:29,489 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:29,493 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:29,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:29,501 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:29,504 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:29,506 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:29,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:29,535 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:29,536 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:29,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590523761] [2021-02-23 18:00:29,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:29,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:29,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371617304] [2021-02-23 18:00:29,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:29,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:29,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:29,544 INFO L87 Difference]: Start difference. First operand 699 states and 906 transitions. Second operand 4 states. [2021-02-23 18:00:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:29,979 INFO L93 Difference]: Finished difference Result 1967 states and 2572 transitions. [2021-02-23 18:00:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:29,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-23 18:00:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:29,987 INFO L225 Difference]: With dead ends: 1967 [2021-02-23 18:00:29,987 INFO L226 Difference]: Without dead ends: 1309 [2021-02-23 18:00:29,990 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 [2021-02-23 18:00:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-02-23 18:00:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1307. [2021-02-23 18:00:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-23 18:00:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1674 transitions. [2021-02-23 18:00:30,207 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1674 transitions. Word has length 67 [2021-02-23 18:00:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:30,207 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1674 transitions. [2021-02-23 18:00:30,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1674 transitions. [2021-02-23 18:00:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-23 18:00:30,210 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:30,210 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] [2021-02-23 18:00:30,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-23 18:00:30,210 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1181748528, now seen corresponding path program 1 times [2021-02-23 18:00:30,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:30,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1243865462] [2021-02-23 18:00:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:30,213 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:30,234 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:30,234 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:30,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:30,235 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:30,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:30,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:30,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:30,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:30,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:30,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1243865462] [2021-02-23 18:00:30,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:30,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:30,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959739781] [2021-02-23 18:00:30,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:30,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:30,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:30,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:30,279 INFO L87 Difference]: Start difference. First operand 1307 states and 1674 transitions. Second operand 4 states. [2021-02-23 18:00:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:30,770 INFO L93 Difference]: Finished difference Result 1567 states and 1996 transitions. [2021-02-23 18:00:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:30,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-23 18:00:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:30,779 INFO L225 Difference]: With dead ends: 1567 [2021-02-23 18:00:30,779 INFO L226 Difference]: Without dead ends: 1565 [2021-02-23 18:00:30,780 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 [2021-02-23 18:00:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2021-02-23 18:00:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1307. [2021-02-23 18:00:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-23 18:00:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1658 transitions. [2021-02-23 18:00:30,975 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1658 transitions. Word has length 68 [2021-02-23 18:00:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:30,975 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1658 transitions. [2021-02-23 18:00:30,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1658 transitions. [2021-02-23 18:00:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-23 18:00:30,977 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:30,977 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] [2021-02-23 18:00:30,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-23 18:00:30,978 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 403959429, now seen corresponding path program 1 times [2021-02-23 18:00:30,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:30,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597945821] [2021-02-23 18:00:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:30,983 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:31,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:31,003 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:31,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:31,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:31,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:31,008 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:31,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:31,036 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:31,037 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:31,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597945821] [2021-02-23 18:00:31,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:31,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:31,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195078059] [2021-02-23 18:00:31,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:31,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:31,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:31,044 INFO L87 Difference]: Start difference. First operand 1307 states and 1658 transitions. Second operand 4 states. [2021-02-23 18:00:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:31,655 INFO L93 Difference]: Finished difference Result 3743 states and 4764 transitions. [2021-02-23 18:00:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:31,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-23 18:00:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:31,668 INFO L225 Difference]: With dead ends: 3743 [2021-02-23 18:00:31,669 INFO L226 Difference]: Without dead ends: 2477 [2021-02-23 18:00:31,672 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 [2021-02-23 18:00:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-02-23 18:00:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2475. [2021-02-23 18:00:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-23 18:00:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3082 transitions. [2021-02-23 18:00:32,110 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3082 transitions. Word has length 68 [2021-02-23 18:00:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:32,111 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3082 transitions. [2021-02-23 18:00:32,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3082 transitions. [2021-02-23 18:00:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-23 18:00:32,115 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:32,115 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] [2021-02-23 18:00:32,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-23 18:00:32,115 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:32,118 INFO L82 PathProgramCache]: Analyzing trace with hash 863214073, now seen corresponding path program 1 times [2021-02-23 18:00:32,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:32,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1046139896] [2021-02-23 18:00:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:32,140 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:32,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:32,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:32,162 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:32,162 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:32,165 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:32,166 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:32,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:32,202 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:32,205 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:32,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1046139896] [2021-02-23 18:00:32,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:32,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:32,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62167651] [2021-02-23 18:00:32,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:32,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:32,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:32,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:32,216 INFO L87 Difference]: Start difference. First operand 2475 states and 3082 transitions. Second operand 4 states. [2021-02-23 18:00:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:33,168 INFO L93 Difference]: Finished difference Result 2927 states and 3596 transitions. [2021-02-23 18:00:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:33,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-23 18:00:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:33,182 INFO L225 Difference]: With dead ends: 2927 [2021-02-23 18:00:33,183 INFO L226 Difference]: Without dead ends: 2925 [2021-02-23 18:00:33,184 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 [2021-02-23 18:00:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2021-02-23 18:00:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2475. [2021-02-23 18:00:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-23 18:00:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3050 transitions. [2021-02-23 18:00:33,609 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3050 transitions. Word has length 69 [2021-02-23 18:00:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:33,609 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3050 transitions. [2021-02-23 18:00:33,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3050 transitions. [2021-02-23 18:00:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-23 18:00:33,612 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:33,612 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] [2021-02-23 18:00:33,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-23 18:00:33,613 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash -361912749, now seen corresponding path program 1 times [2021-02-23 18:00:33,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:33,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [110140073] [2021-02-23 18:00:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:33,615 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:33,633 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:33,634 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:33,635 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:33,635 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:33,638 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:33,639 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:33,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:33,664 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:33,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:33,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [110140073] [2021-02-23 18:00:33,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:33,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:33,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745859816] [2021-02-23 18:00:33,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:33,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:33,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:33,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:33,672 INFO L87 Difference]: Start difference. First operand 2475 states and 3050 transitions. Second operand 4 states. [2021-02-23 18:00:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:34,634 INFO L93 Difference]: Finished difference Result 7149 states and 8811 transitions. [2021-02-23 18:00:34,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:34,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-23 18:00:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:34,646 INFO L225 Difference]: With dead ends: 7149 [2021-02-23 18:00:34,647 INFO L226 Difference]: Without dead ends: 2475 [2021-02-23 18:00:34,656 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 [2021-02-23 18:00:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2021-02-23 18:00:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2021-02-23 18:00:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-23 18:00:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2922 transitions. [2021-02-23 18:00:35,065 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2922 transitions. Word has length 69 [2021-02-23 18:00:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:35,065 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2922 transitions. [2021-02-23 18:00:35,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2922 transitions. [2021-02-23 18:00:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 18:00:35,068 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:00:35,068 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] [2021-02-23 18:00:35,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-23 18:00:35,069 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:00:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:00:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash -421419068, now seen corresponding path program 1 times [2021-02-23 18:00:35,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:00:35,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1137420359] [2021-02-23 18:00:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:00:35,072 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:00:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:35,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:35,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:35,093 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:35,093 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:00:35,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:35,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:35,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:00:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:00:35,122 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:00:35,123 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:00:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 18:00:35,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1137420359] [2021-02-23 18:00:35,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:00:35,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:00:35,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364479485] [2021-02-23 18:00:35,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:00:35,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:00:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:00:35,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:00:35,130 INFO L87 Difference]: Start difference. First operand 2475 states and 2922 transitions. Second operand 4 states. [2021-02-23 18:00:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:00:35,639 INFO L93 Difference]: Finished difference Result 2475 states and 2922 transitions. [2021-02-23 18:00:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 18:00:35,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-02-23 18:00:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:00:35,640 INFO L225 Difference]: With dead ends: 2475 [2021-02-23 18:00:35,640 INFO L226 Difference]: Without dead ends: 0 [2021-02-23 18:00:35,645 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 [2021-02-23 18:00:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-23 18:00:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-23 18:00:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-23 18:00:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-23 18:00:35,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-02-23 18:00:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:00:35,647 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-23 18:00:35,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:00:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-23 18:00:35,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-23 18:00:35,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-23 18:00:35,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-23 18:00:35,929 WARN L202 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2021-02-23 18:00:36,202 WARN L202 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2021-02-23 18:00:36,868 WARN L202 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 18:00:37,369 WARN L202 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 18:00:37,825 WARN L202 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 18:00:38,284 WARN L202 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 18:00:38,982 WARN L202 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-02-23 18:00:39,168 WARN L202 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 85 [2021-02-23 18:00:39,472 WARN L202 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-23 18:00:39,888 WARN L202 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2021-02-23 18:00:40,145 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-23 18:00:40,341 WARN L202 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 65 [2021-02-23 18:00:40,608 WARN L202 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 34 [2021-02-23 18:00:40,898 WARN L202 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 65 [2021-02-23 18:00:41,137 WARN L202 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2021-02-23 18:00:41,357 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-23 18:00:41,556 WARN L202 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2021-02-23 18:00:41,694 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-23 18:00:41,982 WARN L202 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 18:00:42,124 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 45 [2021-02-23 18:00:42,562 WARN L202 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 18:00:42,722 WARN L202 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2021-02-23 18:00:43,297 WARN L202 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 39 [2021-02-23 18:00:43,577 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 31 [2021-02-23 18:00:43,735 WARN L202 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2021-02-23 18:00:45,025 WARN L202 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-23 18:00:53,167 WARN L202 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-23 18:00:54,420 WARN L202 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-23 18:00:54,673 WARN L202 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-23 18:00:54,957 WARN L202 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-23 18:00:56,390 WARN L202 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-23 18:01:00,096 WARN L202 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-23 18:01:00,676 WARN L202 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-23 18:01:00,813 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-23 18:01:00,946 WARN L202 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-23 18:01:02,499 WARN L202 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-23 18:01:03,066 WARN L202 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-23 18:01:03,320 WARN L202 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-23 18:01:06,686 WARN L202 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-23 18:01:06,800 WARN L202 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-23 18:01:10,465 WARN L202 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-23 18:01:11,117 WARN L202 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-23 18:01:11,263 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-23 18:01:11,829 WARN L202 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-23 18:01:15,163 WARN L202 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-23 18:01:16,671 WARN L202 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-23 18:01:16,952 WARN L202 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-23 18:01:17,313 WARN L202 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-23 18:01:20,592 WARN L202 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-23 18:01:21,243 WARN L202 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-23 18:01:21,378 WARN L202 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-23 18:01:21,383 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-23 18:01:21,383 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-23 18:01:21,383 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-23 18:01:21,384 INFO L192 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: true [2021-02-23 18:01:21,384 INFO L192 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: true [2021-02-23 18:01:21,384 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 18:01:21,384 INFO L192 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: true [2021-02-23 18:01:21,384 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-23 18:01:21,384 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2021-02-23 18:01:21,385 INFO L185 CegarLoopUtils]: 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|)) [2021-02-23 18:01:21,385 INFO L192 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: true [2021-02-23 18:01:21,385 INFO L192 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: true [2021-02-23 18:01:21,385 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-23 18:01:21,385 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-23 18:01:21,385 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 18:01:21,385 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-23 18:01:21,385 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-23 18:01:21,386 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,386 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-23 18:01:21,386 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2021-02-23 18:01:21,387 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,387 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,388 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,388 INFO L192 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: true [2021-02-23 18:01:21,388 INFO L192 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: true [2021-02-23 18:01:21,388 INFO L192 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: true [2021-02-23 18:01:21,389 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,389 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,389 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,389 INFO L192 CegarLoopUtils]: At program point L119(lines 7 123) the Hoare annotation is: true [2021-02-23 18:01:21,389 INFO L192 CegarLoopUtils]: At program point L53(lines 53 55) the Hoare annotation is: true [2021-02-23 18:01:21,389 INFO L192 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-02-23 18:01:21,389 INFO L192 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: true [2021-02-23 18:01:21,390 INFO L185 CegarLoopUtils]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-23 18:01:21,390 INFO L192 CegarLoopUtils]: At program point L20-2(line 20) the Hoare annotation is: true [2021-02-23 18:01:21,390 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,390 INFO L192 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: true [2021-02-23 18:01:21,391 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-23 18:01:21,391 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,391 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,391 INFO L192 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: true [2021-02-23 18:01:21,391 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,391 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,391 INFO L192 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: true [2021-02-23 18:01:21,392 INFO L192 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-02-23 18:01:21,392 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2021-02-23 18:01:21,392 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,392 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2021-02-23 18:01:21,392 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-23 18:01:21,392 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2021-02-23 18:01:21,392 INFO L185 CegarLoopUtils]: At program point L121(line 121) the Hoare annotation is: false [2021-02-23 18:01:21,393 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,393 INFO L192 CegarLoopUtils]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2021-02-23 18:01:21,393 INFO L192 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: true [2021-02-23 18:01:21,393 INFO L192 CegarLoopUtils]: At program point L14(line 14) the Hoare annotation is: true [2021-02-23 18:01:21,393 INFO L192 CegarLoopUtils]: At program point L14-1(line 14) the Hoare annotation is: true [2021-02-23 18:01:21,393 INFO L192 CegarLoopUtils]: At program point L14-2(line 14) the Hoare annotation is: true [2021-02-23 18:01:21,393 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,393 INFO L192 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: true [2021-02-23 18:01:21,393 INFO L185 CegarLoopUtils]: At program point L122(line 122) the Hoare annotation is: false [2021-02-23 18:01:21,394 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,394 INFO L192 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-02-23 18:01:21,394 INFO L192 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: true [2021-02-23 18:01:21,394 INFO L192 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: true [2021-02-23 18:01:21,394 INFO L185 CegarLoopUtils]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-23 18:01:21,394 INFO L185 CegarLoopUtils]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2021-02-23 18:01:21,394 INFO L192 CegarLoopUtils]: At program point L15(line 15) the Hoare annotation is: true [2021-02-23 18:01:21,395 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,395 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,395 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,396 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,396 INFO L192 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: true [2021-02-23 18:01:21,396 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,396 INFO L185 CegarLoopUtils]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-23 18:01:21,396 INFO L192 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: true [2021-02-23 18:01:21,396 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,397 INFO L192 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: true [2021-02-23 18:01:21,397 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-23 18:01:21,397 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-23 18:01:21,397 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,397 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,397 INFO L192 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-02-23 18:01:21,397 INFO L192 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: true [2021-02-23 18:01:21,398 INFO L192 CegarLoopUtils]: At program point L33-2(line 33) the Hoare annotation is: true [2021-02-23 18:01:21,398 INFO L185 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-23 18:01:21,398 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,398 INFO L192 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: true [2021-02-23 18:01:21,399 INFO L192 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: true [2021-02-23 18:01:21,399 INFO L192 CegarLoopUtils]: At program point L17-2(line 17) the Hoare annotation is: true [2021-02-23 18:01:21,399 INFO L185 CegarLoopUtils]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2021-02-23 18:01:21,399 INFO L192 CegarLoopUtils]: At program point L9(line 9) the Hoare annotation is: true [2021-02-23 18:01:21,399 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,399 INFO L192 CegarLoopUtils]: At program point L34(lines 34 36) the Hoare annotation is: true [2021-02-23 18:01:21,399 INFO L192 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: true [2021-02-23 18:01:21,400 INFO L192 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: true [2021-02-23 18:01:21,400 INFO L192 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: true [2021-02-23 18:01:21,400 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,401 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-23 18:01:21,401 INFO L185 CegarLoopUtils]: 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))) [2021-02-23 18:01:21,401 INFO L192 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: true [2021-02-23 18:01:21,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 06:01:21 BoogieIcfgContainer [2021-02-23 18:01:21,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-23 18:01:21,415 INFO L168 Benchmark]: Toolchain (without parser) took 58101.90 ms. Allocated memory was 152.0 MB in the beginning and 892.3 MB in the end (delta: 740.3 MB). Free memory was 128.9 MB in the beginning and 767.0 MB in the end (delta: -638.1 MB). Peak memory consumption was 560.0 MB. Max. memory is 8.0 GB. [2021-02-23 18:01:21,415 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 152.0 MB. Free memory is still 124.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 18:01:21,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.39 ms. Allocated memory is still 152.0 MB. Free memory was 127.7 MB in the beginning and 117.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-23 18:01:21,416 INFO L168 Benchmark]: Boogie Preprocessor took 42.79 ms. Allocated memory is still 152.0 MB. Free memory was 117.8 MB in the beginning and 116.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-23 18:01:21,417 INFO L168 Benchmark]: RCFGBuilder took 719.11 ms. Allocated memory is still 152.0 MB. Free memory was 116.2 MB in the beginning and 124.0 MB in the end (delta: -7.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 8.0 GB. [2021-02-23 18:01:21,417 INFO L168 Benchmark]: TraceAbstraction took 57001.48 ms. Allocated memory was 152.0 MB in the beginning and 892.3 MB in the end (delta: 740.3 MB). Free memory was 123.5 MB in the beginning and 767.0 MB in the end (delta: -643.5 MB). Peak memory consumption was 554.6 MB. Max. memory is 8.0 GB. [2021-02-23 18:01:21,419 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.29 ms. Allocated memory is still 152.0 MB. Free memory is still 124.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 315.39 ms. Allocated memory is still 152.0 MB. Free memory was 127.7 MB in the beginning and 117.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.79 ms. Allocated memory is still 152.0 MB. Free memory was 117.8 MB in the beginning and 116.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 719.11 ms. Allocated memory is still 152.0 MB. Free memory was 116.2 MB in the beginning and 124.0 MB in the end (delta: -7.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 57001.48 ms. Allocated memory was 152.0 MB in the beginning and 892.3 MB in the end (delta: 740.3 MB). Free memory was 123.5 MB in the beginning and 767.0 MB in the end (delta: -643.5 MB). Peak memory consumption was 554.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is 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: 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.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1927 SDtfs, 2229 SDslu, 214 SDs, 0 SdLazy, 1391 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2475occurred 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, 1020 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 97 LocationsWithAnnotation, 97 PreInvPairs, 4777 NumberOfFragments, 13957 HoareAnnotationTreeSize, 97 FomulaSimplifications, 1335593 FormulaSimplificationTreeSizeReduction, 8.1s HoareSimplificationTime, 97 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 37.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...