/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-23 23:01:04,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 23:01:04,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 23:01:04,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 23:01:04,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 23:01:04,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 23:01:04,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 23:01:04,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 23:01:04,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 23:01:04,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 23:01:04,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 23:01:04,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 23:01:04,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 23:01:04,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 23:01:04,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 23:01:04,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 23:01:04,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 23:01:04,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 23:01:04,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 23:01:04,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 23:01:04,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 23:01:04,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 23:01:04,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 23:01:04,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 23:01:04,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 23:01:04,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 23:01:04,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 23:01:04,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 23:01:04,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 23:01:04,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 23:01:04,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 23:01:04,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 23:01:04,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 23:01:04,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 23:01:04,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 23:01:04,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 23:01:04,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 23:01:04,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 23:01:04,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 23:01:04,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 23:01:04,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 23:01:04,402 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 23:01:04,425 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 23:01:04,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 23:01:04,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 23:01:04,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 23:01:04,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 23:01:04,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 23:01:04,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 23:01:04,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 23:01:04,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 23:01:04,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 23:01:04,432 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 23:01:04,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 23:01:04,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 23:01:04,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 23:01:04,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 23:01:04,434 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-23 23:01:04,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-23 23:01:04,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 23:01:04,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 23:01:04,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 23:01:04,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-23 23:01:04,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 23:01:04,435 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-23 23:01:04,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 23:01:04,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 23:01:04,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 23:01:04,947 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 23:01:04,950 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 23:01:04,952 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 23:01:05,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223dcc535/b6d23c7fc4594cc38a7f1c16d2a7de08/FLAG359cc33d2 [2021-02-23 23:01:05,698 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 23:01:05,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2021-02-23 23:01:05,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223dcc535/b6d23c7fc4594cc38a7f1c16d2a7de08/FLAG359cc33d2 [2021-02-23 23:01:06,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223dcc535/b6d23c7fc4594cc38a7f1c16d2a7de08 [2021-02-23 23:01:06,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 23:01:06,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 23:01:06,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 23:01:06,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 23:01:06,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 23:01:06,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151d4790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06, skipping insertion in model container [2021-02-23 23:01:06,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 23:01:06,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 23:01:06,327 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 23:01:06,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 23:01:06,343 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 23:01:06,370 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 23:01:06,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 23:01:06,389 INFO L208 MainTranslator]: Completed translation [2021-02-23 23:01:06,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06 WrapperNode [2021-02-23 23:01:06,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 23:01:06,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 23:01:06,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 23:01:06,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 23:01:06,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... [2021-02-23 23:01:06,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 23:01:06,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 23:01:06,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 23:01:06,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 23:01:06,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 23:01:06,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 23:01:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 23:01:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 23:01:06,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 23:01:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 23:01:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 23:01:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 23:01:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 23:01:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-23 23:01:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 23:01:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 23:01:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 23:01:06,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 23:01:06,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 23:01:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 23:01:06,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 23:01:07,286 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 23:01:07,287 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-02-23 23:01:07,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 11:01:07 BoogieIcfgContainer [2021-02-23 23:01:07,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 23:01:07,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 23:01:07,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 23:01:07,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 23:01:07,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 11:01:06" (1/3) ... [2021-02-23 23:01:07,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d03c14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 11:01:07, skipping insertion in model container [2021-02-23 23:01:07,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 11:01:06" (2/3) ... [2021-02-23 23:01:07,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d03c14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 11:01:07, skipping insertion in model container [2021-02-23 23:01:07,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 11:01:07" (3/3) ... [2021-02-23 23:01:07,300 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2021-02-23 23:01:07,310 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-23 23:01:07,316 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 23:01:07,339 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 23:01:07,368 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 23:01:07,369 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 23:01:07,369 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-23 23:01:07,369 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 23:01:07,369 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 23:01:07,369 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 23:01:07,370 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 23:01:07,370 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 23:01:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2021-02-23 23:01:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-02-23 23:01:07,409 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:07,410 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 23:01:07,411 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:07,419 INFO L82 PathProgramCache]: Analyzing trace with hash -734651465, now seen corresponding path program 1 times [2021-02-23 23:01:07,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:07,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [192508900] [2021-02-23 23:01:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:07,710 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:07,712 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:07,714 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:07,715 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:07,735 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:07,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:07,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:07,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:07,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:07,879 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 23:01:07,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [192508900] [2021-02-23 23:01:07,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:07,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:07,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977503043] [2021-02-23 23:01:07,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:07,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:07,912 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2021-02-23 23:01:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:08,608 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2021-02-23 23:01:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:08,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-02-23 23:01:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:08,625 INFO L225 Difference]: With dead ends: 200 [2021-02-23 23:01:08,625 INFO L226 Difference]: Without dead ends: 136 [2021-02-23 23:01:08,629 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 23:01:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-02-23 23:01:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2021-02-23 23:01:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-23 23:01:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2021-02-23 23:01:08,711 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 63 [2021-02-23 23:01:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:08,712 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2021-02-23 23:01:08,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2021-02-23 23:01:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-23 23:01:08,715 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:08,716 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 23:01:08,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 23:01:08,716 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash -106893304, now seen corresponding path program 1 times [2021-02-23 23:01:08,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:08,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1582181328] [2021-02-23 23:01:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:08,791 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:08,792 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:08,793 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:08,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:08,798 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:08,801 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:08,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:08,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:08,842 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:08,850 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 23:01:08,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1582181328] [2021-02-23 23:01:08,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:08,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:08,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763938830] [2021-02-23 23:01:08,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:08,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:08,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:08,855 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand 4 states. [2021-02-23 23:01:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:09,313 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2021-02-23 23:01:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:09,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-23 23:01:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:09,323 INFO L225 Difference]: With dead ends: 162 [2021-02-23 23:01:09,324 INFO L226 Difference]: Without dead ends: 160 [2021-02-23 23:01:09,325 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 23:01:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-02-23 23:01:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2021-02-23 23:01:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-23 23:01:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2021-02-23 23:01:09,365 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 64 [2021-02-23 23:01:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:09,366 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2021-02-23 23:01:09,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2021-02-23 23:01:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-23 23:01:09,369 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:09,369 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 23:01:09,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 23:01:09,370 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1299113955, now seen corresponding path program 1 times [2021-02-23 23:01:09,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:09,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1813096723] [2021-02-23 23:01:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:09,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:09,459 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:09,464 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:09,465 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:09,469 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:09,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:09,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:09,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:09,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:09,537 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 23:01:09,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1813096723] [2021-02-23 23:01:09,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:09,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:09,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324455583] [2021-02-23 23:01:09,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:09,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:09,543 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand 4 states. [2021-02-23 23:01:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:09,900 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2021-02-23 23:01:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:09,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-23 23:01:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:09,905 INFO L225 Difference]: With dead ends: 314 [2021-02-23 23:01:09,906 INFO L226 Difference]: Without dead ends: 221 [2021-02-23 23:01:09,907 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 23:01:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-02-23 23:01:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2021-02-23 23:01:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-23 23:01:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2021-02-23 23:01:09,987 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 64 [2021-02-23 23:01:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:09,987 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2021-02-23 23:01:09,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2021-02-23 23:01:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-23 23:01:09,994 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:09,995 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 23:01:09,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 23:01:09,995 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash -429978543, now seen corresponding path program 1 times [2021-02-23 23:01:09,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:09,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282969849] [2021-02-23 23:01:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:10,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:10,097 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,098 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:10,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,103 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:10,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:10,157 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:10,167 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 23:01:10,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282969849] [2021-02-23 23:01:10,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:10,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:10,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395170815] [2021-02-23 23:01:10,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:10,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:10,173 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand 4 states. [2021-02-23 23:01:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:10,464 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2021-02-23 23:01:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:10,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-23 23:01:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:10,469 INFO L225 Difference]: With dead ends: 267 [2021-02-23 23:01:10,469 INFO L226 Difference]: Without dead ends: 265 [2021-02-23 23:01:10,469 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 23:01:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-02-23 23:01:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2021-02-23 23:01:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-23 23:01:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 286 transitions. [2021-02-23 23:01:10,520 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 286 transitions. Word has length 65 [2021-02-23 23:01:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:10,520 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 286 transitions. [2021-02-23 23:01:10,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 286 transitions. [2021-02-23 23:01:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-23 23:01:10,526 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:10,526 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 23:01:10,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 23:01:10,527 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1617581589, now seen corresponding path program 1 times [2021-02-23 23:01:10,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:10,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908483423] [2021-02-23 23:01:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:10,608 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,610 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:10,611 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:10,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:10,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:10,665 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:10,666 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:10,672 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 23:01:10,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908483423] [2021-02-23 23:01:10,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:10,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:10,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695649294] [2021-02-23 23:01:10,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:10,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:10,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:10,685 INFO L87 Difference]: Start difference. First operand 219 states and 286 transitions. Second operand 4 states. [2021-02-23 23:01:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:10,967 INFO L93 Difference]: Finished difference Result 563 states and 760 transitions. [2021-02-23 23:01:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:10,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-23 23:01:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:10,971 INFO L225 Difference]: With dead ends: 563 [2021-02-23 23:01:10,971 INFO L226 Difference]: Without dead ends: 385 [2021-02-23 23:01:10,973 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 23:01:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-02-23 23:01:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2021-02-23 23:01:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-23 23:01:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 506 transitions. [2021-02-23 23:01:11,057 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 506 transitions. Word has length 65 [2021-02-23 23:01:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:11,057 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 506 transitions. [2021-02-23 23:01:11,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2021-02-23 23:01:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-23 23:01:11,059 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:11,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 23:01:11,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 23:01:11,059 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1855685988, now seen corresponding path program 1 times [2021-02-23 23:01:11,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:11,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869463156] [2021-02-23 23:01:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:11,083 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:11,085 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,085 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:11,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:11,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:11,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,117 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:11,122 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 23:01:11,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869463156] [2021-02-23 23:01:11,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:11,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:11,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167955607] [2021-02-23 23:01:11,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:11,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:11,126 INFO L87 Difference]: Start difference. First operand 383 states and 506 transitions. Second operand 4 states. [2021-02-23 23:01:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:11,384 INFO L93 Difference]: Finished difference Result 467 states and 620 transitions. [2021-02-23 23:01:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:11,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-23 23:01:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:11,388 INFO L225 Difference]: With dead ends: 467 [2021-02-23 23:01:11,388 INFO L226 Difference]: Without dead ends: 465 [2021-02-23 23:01:11,389 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 23:01:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-02-23 23:01:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2021-02-23 23:01:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-23 23:01:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 502 transitions. [2021-02-23 23:01:11,472 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 502 transitions. Word has length 66 [2021-02-23 23:01:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:11,472 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 502 transitions. [2021-02-23 23:01:11,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 502 transitions. [2021-02-23 23:01:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-23 23:01:11,474 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:11,475 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 23:01:11,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 23:01:11,475 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1394824017, now seen corresponding path program 1 times [2021-02-23 23:01:11,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:11,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1117075628] [2021-02-23 23:01:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:11,522 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,523 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:11,524 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,525 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:11,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,529 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:11,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:11,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:11,557 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:11,562 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 23:01:11,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1117075628] [2021-02-23 23:01:11,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:11,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:11,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21761244] [2021-02-23 23:01:11,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:11,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:11,564 INFO L87 Difference]: Start difference. First operand 383 states and 502 transitions. Second operand 4 states. [2021-02-23 23:01:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:11,863 INFO L93 Difference]: Finished difference Result 1043 states and 1392 transitions. [2021-02-23 23:01:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:11,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-23 23:01:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:11,868 INFO L225 Difference]: With dead ends: 1043 [2021-02-23 23:01:11,868 INFO L226 Difference]: Without dead ends: 701 [2021-02-23 23:01:11,870 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 23:01:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-02-23 23:01:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 699. [2021-02-23 23:01:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-23 23:01:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2021-02-23 23:01:12,021 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 66 [2021-02-23 23:01:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:12,021 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2021-02-23 23:01:12,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2021-02-23 23:01:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-23 23:01:12,023 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:12,023 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 23:01:12,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 23:01:12,024 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:12,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:12,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1192023845, now seen corresponding path program 1 times [2021-02-23 23:01:12,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:12,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487898517] [2021-02-23 23:01:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:12,045 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,046 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:12,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:12,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:12,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:12,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:12,083 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 23:01:12,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487898517] [2021-02-23 23:01:12,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:12,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:12,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701774605] [2021-02-23 23:01:12,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:12,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:12,086 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand 4 states. [2021-02-23 23:01:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:12,434 INFO L93 Difference]: Finished difference Result 847 states and 1108 transitions. [2021-02-23 23:01:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:12,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-23 23:01:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:12,440 INFO L225 Difference]: With dead ends: 847 [2021-02-23 23:01:12,440 INFO L226 Difference]: Without dead ends: 845 [2021-02-23 23:01:12,441 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 23:01:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-02-23 23:01:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 699. [2021-02-23 23:01:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-23 23:01:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 906 transitions. [2021-02-23 23:01:12,549 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 906 transitions. Word has length 67 [2021-02-23 23:01:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:12,549 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 906 transitions. [2021-02-23 23:01:12,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 906 transitions. [2021-02-23 23:01:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-23 23:01:12,551 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:12,551 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 23:01:12,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 23:01:12,552 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:12,552 INFO L82 PathProgramCache]: Analyzing trace with hash 290117663, now seen corresponding path program 1 times [2021-02-23 23:01:12,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:12,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1750138854] [2021-02-23 23:01:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:12,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,573 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:12,574 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,574 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:12,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,579 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:12,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:12,606 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:12,607 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:12,612 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 23:01:12,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1750138854] [2021-02-23 23:01:12,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:12,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:12,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39061627] [2021-02-23 23:01:12,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:12,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:12,614 INFO L87 Difference]: Start difference. First operand 699 states and 906 transitions. Second operand 4 states. [2021-02-23 23:01:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:13,024 INFO L93 Difference]: Finished difference Result 1967 states and 2572 transitions. [2021-02-23 23:01:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:13,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-23 23:01:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:13,034 INFO L225 Difference]: With dead ends: 1967 [2021-02-23 23:01:13,034 INFO L226 Difference]: Without dead ends: 1309 [2021-02-23 23:01:13,036 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 23:01:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-02-23 23:01:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1307. [2021-02-23 23:01:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-23 23:01:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1674 transitions. [2021-02-23 23:01:13,233 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1674 transitions. Word has length 67 [2021-02-23 23:01:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:13,234 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1674 transitions. [2021-02-23 23:01:13,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1674 transitions. [2021-02-23 23:01:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-23 23:01:13,236 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:13,236 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 23:01:13,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-23 23:01:13,236 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1181748528, now seen corresponding path program 1 times [2021-02-23 23:01:13,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:13,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291615521] [2021-02-23 23:01:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:13,256 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:13,257 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:13,258 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:13,258 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:13,261 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:13,262 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:13,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:13,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:13,288 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:13,293 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 23:01:13,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291615521] [2021-02-23 23:01:13,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:13,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:13,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261784912] [2021-02-23 23:01:13,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:13,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:13,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:13,296 INFO L87 Difference]: Start difference. First operand 1307 states and 1674 transitions. Second operand 4 states. [2021-02-23 23:01:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:13,783 INFO L93 Difference]: Finished difference Result 1567 states and 1996 transitions. [2021-02-23 23:01:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:13,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-23 23:01:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:13,793 INFO L225 Difference]: With dead ends: 1567 [2021-02-23 23:01:13,793 INFO L226 Difference]: Without dead ends: 1565 [2021-02-23 23:01:13,795 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 23:01:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2021-02-23 23:01:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1307. [2021-02-23 23:01:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-23 23:01:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1658 transitions. [2021-02-23 23:01:14,014 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1658 transitions. Word has length 68 [2021-02-23 23:01:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:14,015 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1658 transitions. [2021-02-23 23:01:14,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1658 transitions. [2021-02-23 23:01:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-23 23:01:14,016 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:14,017 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 23:01:14,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-23 23:01:14,017 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash 403959429, now seen corresponding path program 1 times [2021-02-23 23:01:14,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:14,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693911572] [2021-02-23 23:01:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:14,035 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:14,037 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:14,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:14,038 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:14,042 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:14,042 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:14,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:14,069 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:14,070 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:14,076 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 23:01:14,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693911572] [2021-02-23 23:01:14,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:14,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:14,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584529730] [2021-02-23 23:01:14,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:14,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:14,078 INFO L87 Difference]: Start difference. First operand 1307 states and 1658 transitions. Second operand 4 states. [2021-02-23 23:01:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:14,684 INFO L93 Difference]: Finished difference Result 3743 states and 4764 transitions. [2021-02-23 23:01:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:14,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-23 23:01:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:14,697 INFO L225 Difference]: With dead ends: 3743 [2021-02-23 23:01:14,698 INFO L226 Difference]: Without dead ends: 2477 [2021-02-23 23:01:14,702 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 23:01:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-02-23 23:01:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2475. [2021-02-23 23:01:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-23 23:01:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3082 transitions. [2021-02-23 23:01:15,095 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3082 transitions. Word has length 68 [2021-02-23 23:01:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:15,096 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3082 transitions. [2021-02-23 23:01:15,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3082 transitions. [2021-02-23 23:01:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-23 23:01:15,098 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:15,099 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 23:01:15,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-23 23:01:15,099 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash 863214073, now seen corresponding path program 1 times [2021-02-23 23:01:15,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:15,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554444797] [2021-02-23 23:01:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:15,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:15,120 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:15,120 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:15,121 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:15,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:15,124 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:15,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:15,156 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:15,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:15,163 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 23:01:15,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554444797] [2021-02-23 23:01:15,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:15,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:15,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521505809] [2021-02-23 23:01:15,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:15,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:15,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:15,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:15,166 INFO L87 Difference]: Start difference. First operand 2475 states and 3082 transitions. Second operand 4 states. [2021-02-23 23:01:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:15,922 INFO L93 Difference]: Finished difference Result 2927 states and 3596 transitions. [2021-02-23 23:01:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:15,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-23 23:01:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:15,939 INFO L225 Difference]: With dead ends: 2927 [2021-02-23 23:01:15,939 INFO L226 Difference]: Without dead ends: 2925 [2021-02-23 23:01:15,941 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 23:01:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2021-02-23 23:01:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2475. [2021-02-23 23:01:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-23 23:01:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3050 transitions. [2021-02-23 23:01:16,365 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3050 transitions. Word has length 69 [2021-02-23 23:01:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:16,365 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3050 transitions. [2021-02-23 23:01:16,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3050 transitions. [2021-02-23 23:01:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-23 23:01:16,368 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:16,368 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 23:01:16,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-23 23:01:16,369 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash -361912749, now seen corresponding path program 1 times [2021-02-23 23:01:16,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:16,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721489368] [2021-02-23 23:01:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:16,389 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:16,390 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:16,391 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:16,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:16,394 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:16,395 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:16,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:16,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:16,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:16,439 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 23:01:16,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721489368] [2021-02-23 23:01:16,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:16,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:16,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6968659] [2021-02-23 23:01:16,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:16,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:16,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:16,443 INFO L87 Difference]: Start difference. First operand 2475 states and 3050 transitions. Second operand 4 states. [2021-02-23 23:01:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:17,660 INFO L93 Difference]: Finished difference Result 7149 states and 8811 transitions. [2021-02-23 23:01:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:17,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-23 23:01:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:17,674 INFO L225 Difference]: With dead ends: 7149 [2021-02-23 23:01:17,675 INFO L226 Difference]: Without dead ends: 2475 [2021-02-23 23:01:17,688 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 23:01:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2021-02-23 23:01:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2021-02-23 23:01:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-23 23:01:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2922 transitions. [2021-02-23 23:01:18,232 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2922 transitions. Word has length 69 [2021-02-23 23:01:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:18,233 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2922 transitions. [2021-02-23 23:01:18,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2922 transitions. [2021-02-23 23:01:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-23 23:01:18,235 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 23:01:18,236 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 23:01:18,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-23 23:01:18,236 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 23:01:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 23:01:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash -421419068, now seen corresponding path program 1 times [2021-02-23 23:01:18,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 23:01:18,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1264564899] [2021-02-23 23:01:18,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 23:01:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:18,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:18,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:18,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:18,265 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 23:01:18,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:18,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:18,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 23:01:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 23:01:18,301 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 23:01:18,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 23:01:18,311 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 23:01:18,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1264564899] [2021-02-23 23:01:18,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 23:01:18,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 23:01:18,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475196513] [2021-02-23 23:01:18,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 23:01:18,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 23:01:18,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 23:01:18,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 23:01:18,314 INFO L87 Difference]: Start difference. First operand 2475 states and 2922 transitions. Second operand 4 states. [2021-02-23 23:01:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 23:01:18,950 INFO L93 Difference]: Finished difference Result 2475 states and 2922 transitions. [2021-02-23 23:01:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-23 23:01:18,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-02-23 23:01:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 23:01:18,951 INFO L225 Difference]: With dead ends: 2475 [2021-02-23 23:01:18,951 INFO L226 Difference]: Without dead ends: 0 [2021-02-23 23:01:18,957 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 23:01:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-23 23:01:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-23 23:01:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-23 23:01:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-23 23:01:18,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-02-23 23:01:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 23:01:18,958 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-23 23:01:18,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 23:01:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-23 23:01:18,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-23 23:01:18,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-23 23:01:18,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-23 23:01:19,240 WARN L202 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2021-02-23 23:01:19,486 WARN L202 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2021-02-23 23:01:20,104 WARN L202 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 23:01:20,682 WARN L202 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 23:01:21,218 WARN L202 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 23:01:21,870 WARN L202 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 23:01:22,543 WARN L202 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-02-23 23:01:22,755 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 85 [2021-02-23 23:01:23,118 WARN L202 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-23 23:01:23,603 WARN L202 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2021-02-23 23:01:23,850 WARN L202 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-23 23:01:24,044 WARN L202 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 65 [2021-02-23 23:01:24,265 WARN L202 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 34 [2021-02-23 23:01:24,702 WARN L202 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2021-02-23 23:01:24,928 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-23 23:01:25,106 WARN L202 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2021-02-23 23:01:25,229 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-23 23:01:25,536 WARN L202 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 23:01:25,712 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 45 [2021-02-23 23:01:25,855 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 34 [2021-02-23 23:01:26,117 WARN L202 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-23 23:01:26,279 WARN L202 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2021-02-23 23:01:26,917 WARN L202 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 39 [2021-02-23 23:01:27,216 WARN L202 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 31 [2021-02-23 23:01:27,389 WARN L202 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2021-02-23 23:01:28,729 WARN L202 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-23 23:01:37,391 WARN L202 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-23 23:01:38,765 WARN L202 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-23 23:01:39,003 WARN L202 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-23 23:01:39,292 WARN L202 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-23 23:01:40,694 WARN L202 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-23 23:01:44,377 WARN L202 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-23 23:01:44,949 WARN L202 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-23 23:01:45,084 WARN L202 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-23 23:01:45,211 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-23 23:01:46,756 WARN L202 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-23 23:01:47,329 WARN L202 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-23 23:01:47,583 WARN L202 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-23 23:01:50,996 WARN L202 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-23 23:01:51,110 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-23 23:01:54,851 WARN L202 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-23 23:01:55,510 WARN L202 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-23 23:01:55,656 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-23 23:01:56,246 WARN L202 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-23 23:01:59,604 WARN L202 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-23 23:02:01,137 WARN L202 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-23 23:02:01,429 WARN L202 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-23 23:02:01,813 WARN L202 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-23 23:02:05,147 WARN L202 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-23 23:02:05,800 WARN L202 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-23 23:02:05,936 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-23 23:02:05,941 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-23 23:02:05,942 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-23 23:02:05,942 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-23 23:02:05,942 INFO L192 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: true [2021-02-23 23:02:05,943 INFO L192 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: true [2021-02-23 23:02:05,943 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 23:02:05,943 INFO L192 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: true [2021-02-23 23:02:05,943 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-23 23:02:05,943 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2021-02-23 23:02:05,943 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 23:02:05,944 INFO L192 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: true [2021-02-23 23:02:05,944 INFO L192 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: true [2021-02-23 23:02:05,944 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-23 23:02:05,944 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-23 23:02:05,944 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 23:02:05,944 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-23 23:02:05,944 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-23 23:02:05,945 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 23:02:05,945 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-23 23:02:05,945 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2021-02-23 23:02:05,946 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 23:02:05,947 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 23:02:05,948 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 23:02:05,948 INFO L192 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: true [2021-02-23 23:02:05,949 INFO L192 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: true [2021-02-23 23:02:05,949 INFO L192 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: true [2021-02-23 23:02:05,949 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 23:02:05,949 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 23:02:05,950 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 23:02:05,950 INFO L192 CegarLoopUtils]: At program point L119(lines 7 123) the Hoare annotation is: true [2021-02-23 23:02:05,950 INFO L192 CegarLoopUtils]: At program point L53(lines 53 55) the Hoare annotation is: true [2021-02-23 23:02:05,950 INFO L192 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-02-23 23:02:05,950 INFO L192 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: true [2021-02-23 23:02:05,950 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 23:02:05,950 INFO L192 CegarLoopUtils]: At program point L20-2(line 20) the Hoare annotation is: true [2021-02-23 23:02:05,951 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 23:02:05,951 INFO L192 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: true [2021-02-23 23:02:05,951 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-23 23:02:05,952 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 23:02:05,952 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 23:02:05,952 INFO L192 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: true [2021-02-23 23:02:05,952 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 23:02:05,953 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 23:02:05,953 INFO L192 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: true [2021-02-23 23:02:05,953 INFO L192 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-02-23 23:02:05,953 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2021-02-23 23:02:05,953 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 23:02:05,953 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2021-02-23 23:02:05,954 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-23 23:02:05,954 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2021-02-23 23:02:05,954 INFO L185 CegarLoopUtils]: At program point L121(line 121) the Hoare annotation is: false [2021-02-23 23:02:05,954 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 23:02:05,954 INFO L192 CegarLoopUtils]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2021-02-23 23:02:05,954 INFO L192 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: true [2021-02-23 23:02:05,955 INFO L192 CegarLoopUtils]: At program point L14(line 14) the Hoare annotation is: true [2021-02-23 23:02:05,955 INFO L192 CegarLoopUtils]: At program point L14-1(line 14) the Hoare annotation is: true [2021-02-23 23:02:05,955 INFO L192 CegarLoopUtils]: At program point L14-2(line 14) the Hoare annotation is: true [2021-02-23 23:02:05,955 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 23:02:05,955 INFO L192 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: true [2021-02-23 23:02:05,955 INFO L185 CegarLoopUtils]: At program point L122(line 122) the Hoare annotation is: false [2021-02-23 23:02:05,956 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 23:02:05,956 INFO L192 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-02-23 23:02:05,956 INFO L192 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: true [2021-02-23 23:02:05,956 INFO L192 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: true [2021-02-23 23:02:05,956 INFO L185 CegarLoopUtils]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-23 23:02:05,956 INFO L185 CegarLoopUtils]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2021-02-23 23:02:05,956 INFO L192 CegarLoopUtils]: At program point L15(line 15) the Hoare annotation is: true [2021-02-23 23:02:05,957 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 23:02:05,957 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 23:02:05,958 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 23:02:05,958 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 23:02:05,958 INFO L192 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: true [2021-02-23 23:02:05,958 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 23:02:05,958 INFO L185 CegarLoopUtils]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-23 23:02:05,959 INFO L192 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: true [2021-02-23 23:02:05,959 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 23:02:05,959 INFO L192 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: true [2021-02-23 23:02:05,959 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-23 23:02:05,959 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-23 23:02:05,960 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 23:02:05,960 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 23:02:05,960 INFO L192 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-02-23 23:02:05,960 INFO L192 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: true [2021-02-23 23:02:05,960 INFO L192 CegarLoopUtils]: At program point L33-2(line 33) the Hoare annotation is: true [2021-02-23 23:02:05,960 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 23:02:05,961 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 23:02:05,961 INFO L192 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: true [2021-02-23 23:02:05,961 INFO L192 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: true [2021-02-23 23:02:05,961 INFO L192 CegarLoopUtils]: At program point L17-2(line 17) the Hoare annotation is: true [2021-02-23 23:02:05,962 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 23:02:05,962 INFO L192 CegarLoopUtils]: At program point L9(line 9) the Hoare annotation is: true [2021-02-23 23:02:05,962 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 23:02:05,962 INFO L192 CegarLoopUtils]: At program point L34(lines 34 36) the Hoare annotation is: true [2021-02-23 23:02:05,962 INFO L192 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: true [2021-02-23 23:02:05,962 INFO L192 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: true [2021-02-23 23:02:05,962 INFO L192 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: true [2021-02-23 23:02:05,963 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 23:02:05,963 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-23 23:02:05,964 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 23:02:05,964 INFO L192 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: true [2021-02-23 23:02:05,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 11:02:05 BoogieIcfgContainer [2021-02-23 23:02:05,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-23 23:02:05,982 INFO L168 Benchmark]: Toolchain (without parser) took 59890.88 ms. Allocated memory was 158.3 MB in the beginning and 1.0 GB in the end (delta: 867.2 MB). Free memory was 134.4 MB in the beginning and 576.3 MB in the end (delta: -441.9 MB). Peak memory consumption was 638.7 MB. Max. memory is 8.0 GB. [2021-02-23 23:02:05,983 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 158.3 MB. Free memory is still 132.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 23:02:05,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.18 ms. Allocated memory is still 158.3 MB. Free memory was 133.4 MB in the beginning and 123.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-02-23 23:02:05,983 INFO L168 Benchmark]: Boogie Preprocessor took 45.43 ms. Allocated memory is still 158.3 MB. Free memory was 123.4 MB in the beginning and 121.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-23 23:02:05,984 INFO L168 Benchmark]: RCFGBuilder took 851.14 ms. Allocated memory is still 158.3 MB. Free memory was 121.7 MB in the beginning and 130.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. [2021-02-23 23:02:05,984 INFO L168 Benchmark]: TraceAbstraction took 58689.22 ms. Allocated memory was 158.3 MB in the beginning and 1.0 GB in the end (delta: 867.2 MB). Free memory was 130.0 MB in the beginning and 576.3 MB in the end (delta: -446.4 MB). Peak memory consumption was 633.7 MB. Max. memory is 8.0 GB. [2021-02-23 23:02:05,986 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 158.3 MB. Free memory is still 132.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 285.18 ms. Allocated memory is still 158.3 MB. Free memory was 133.4 MB in the beginning and 123.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.43 ms. Allocated memory is still 158.3 MB. Free memory was 123.4 MB in the beginning and 121.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 851.14 ms. Allocated memory is still 158.3 MB. Free memory was 121.7 MB in the beginning and 130.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 58689.22 ms. Allocated memory was 158.3 MB in the beginning and 1.0 GB in the end (delta: 867.2 MB). Free memory was 130.0 MB in the beginning and 576.3 MB in the end (delta: -446.4 MB). Peak memory consumption was 633.7 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.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1927 SDtfs, 2229 SDslu, 214 SDs, 0 SdLazy, 1391 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s 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.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1020 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 97 LocationsWithAnnotation, 97 PreInvPairs, 4777 NumberOfFragments, 13957 HoareAnnotationTreeSize, 97 FomulaSimplifications, 1335593 FormulaSimplificationTreeSizeReduction, 8.5s HoareSimplificationTime, 97 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 38.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 931 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 101395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...