/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/ldv-regression/test24-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:16:57,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:16:57,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:16:57,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:16:57,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:16:57,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:16:57,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:16:57,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:16:57,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:16:57,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:16:57,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:16:57,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:16:57,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:16:57,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:16:57,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:16:57,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:16:57,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:16:57,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:16:57,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:16:57,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:16:57,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:16:57,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:16:57,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:16:57,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:16:57,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:16:57,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:16:57,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:16:57,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:16:57,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:16:57,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:16:57,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:16:57,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:16:57,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:16:57,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:16:57,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:16:57,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:16:57,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:16:57,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:16:57,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:16:57,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:16:57,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:16:57,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:16:57,642 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:16:57,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:16:57,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:16:57,649 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:16:57,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:16:57,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:16:57,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:16:57,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:16:57,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:16:57,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:16:57,652 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:16:57,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:16:57,653 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:16:57,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:16:57,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:16:57,654 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:16:57,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:16:57,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:16:57,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:16:57,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:16:57,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:16:57,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:16:57,655 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:16:58,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:16:58,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:16:58,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:16:58,169 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:16:58,169 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:16:58,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24-2.c [2020-11-07 05:16:58,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796818e41/bf609d5b5c5f41cb941252a98a374225/FLAG8431dd5c9 [2020-11-07 05:16:58,910 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:16:58,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c [2020-11-07 05:16:58,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796818e41/bf609d5b5c5f41cb941252a98a374225/FLAG8431dd5c9 [2020-11-07 05:16:59,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796818e41/bf609d5b5c5f41cb941252a98a374225 [2020-11-07 05:16:59,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:16:59,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:16:59,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:16:59,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:16:59,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:16:59,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534a1a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59, skipping insertion in model container [2020-11-07 05:16:59,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:16:59,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:16:59,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:16:59,536 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:16:59,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:16:59,576 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:16:59,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59 WrapperNode [2020-11-07 05:16:59,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:16:59,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:16:59,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:16:59,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:16:59,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... [2020-11-07 05:16:59,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:16:59,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:16:59,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:16:59,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:16:59,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:16:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:16:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:16:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:16:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-11-07 05:16:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:16:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:16:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:16:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:16:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:16:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:16:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-11-07 05:16:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:16:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:16:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:16:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:16:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:16:59,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:16:59,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:17:00,270 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:17:00,271 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 05:17:00,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:17:00 BoogieIcfgContainer [2020-11-07 05:17:00,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:17:00,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:17:00,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:17:00,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:17:00,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:16:59" (1/3) ... [2020-11-07 05:17:00,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c576b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:17:00, skipping insertion in model container [2020-11-07 05:17:00,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:59" (2/3) ... [2020-11-07 05:17:00,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460c576b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:17:00, skipping insertion in model container [2020-11-07 05:17:00,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:17:00" (3/3) ... [2020-11-07 05:17:00,295 INFO L111 eAbstractionObserver]: Analyzing ICFG test24-2.c [2020-11-07 05:17:00,318 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:17:00,323 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:17:00,343 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:17:00,392 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:17:00,392 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:17:00,393 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:17:00,393 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:17:00,393 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:17:00,394 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:17:00,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:17:00,394 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:17:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-11-07 05:17:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:17:00,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:00,449 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] [2020-11-07 05:17:00,450 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1281420821, now seen corresponding path program 1 times [2020-11-07 05:17:00,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:00,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911401984] [2020-11-07 05:17:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:00,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:00,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 05:17:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:00,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911401984] [2020-11-07 05:17:00,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:17:01,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 05:17:01,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870605250] [2020-11-07 05:17:01,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 05:17:01,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:01,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 05:17:01,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 05:17:01,032 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2020-11-07 05:17:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:01,319 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2020-11-07 05:17:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 05:17:01,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-11-07 05:17:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:01,344 INFO L225 Difference]: With dead ends: 112 [2020-11-07 05:17:01,345 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:17:01,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 05:17:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:17:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 05:17:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 05:17:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 05:17:01,404 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 43 [2020-11-07 05:17:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:01,405 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 05:17:01,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 05:17:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 05:17:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 05:17:01,408 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:01,408 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] [2020-11-07 05:17:01,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:17:01,409 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1979567000, now seen corresponding path program 1 times [2020-11-07 05:17:01,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:01,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1096091524] [2020-11-07 05:17:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:01,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:01,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 05:17:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:01,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1096091524] [2020-11-07 05:17:01,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:17:01,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:17:01,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626187299] [2020-11-07 05:17:01,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:17:01,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:17:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:17:01,548 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2020-11-07 05:17:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:01,766 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2020-11-07 05:17:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:17:01,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-11-07 05:17:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:01,769 INFO L225 Difference]: With dead ends: 99 [2020-11-07 05:17:01,770 INFO L226 Difference]: Without dead ends: 68 [2020-11-07 05:17:01,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:17:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-07 05:17:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2020-11-07 05:17:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-07 05:17:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-11-07 05:17:01,787 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 45 [2020-11-07 05:17:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:01,788 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-11-07 05:17:01,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:17:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-11-07 05:17:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-07 05:17:01,790 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:01,790 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] [2020-11-07 05:17:01,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:17:01,791 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2107402754, now seen corresponding path program 1 times [2020-11-07 05:17:01,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:01,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643605373] [2020-11-07 05:17:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:01,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:01,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 05:17:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:01,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643605373] [2020-11-07 05:17:01,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:01,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 05:17:01,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649230121] [2020-11-07 05:17:01,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:17:01,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:17:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:17:01,948 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 6 states. [2020-11-07 05:17:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:02,166 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2020-11-07 05:17:02,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:17:02,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-11-07 05:17:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:02,169 INFO L225 Difference]: With dead ends: 109 [2020-11-07 05:17:02,169 INFO L226 Difference]: Without dead ends: 78 [2020-11-07 05:17:02,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:17:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-07 05:17:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2020-11-07 05:17:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-07 05:17:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-11-07 05:17:02,183 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 55 [2020-11-07 05:17:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:02,184 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-11-07 05:17:02,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:17:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-11-07 05:17:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:17:02,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:02,186 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:02,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:17:02,187 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash 592176924, now seen corresponding path program 2 times [2020-11-07 05:17:02,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:02,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089717572] [2020-11-07 05:17:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:02,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:02,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 05:17:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:02,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089717572] [2020-11-07 05:17:02,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:02,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:17:02,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109599501] [2020-11-07 05:17:02,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:17:02,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:02,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:17:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:17:02,352 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 8 states. [2020-11-07 05:17:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:02,672 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2020-11-07 05:17:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:17:02,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2020-11-07 05:17:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:02,674 INFO L225 Difference]: With dead ends: 119 [2020-11-07 05:17:02,675 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 05:17:02,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:17:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 05:17:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2020-11-07 05:17:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 05:17:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-11-07 05:17:02,690 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 65 [2020-11-07 05:17:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:02,690 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-11-07 05:17:02,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:17:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-11-07 05:17:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 05:17:02,692 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:02,693 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:02,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:17:02,693 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:02,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:02,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2067969098, now seen corresponding path program 3 times [2020-11-07 05:17:02,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:02,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052980091] [2020-11-07 05:17:02,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:02,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:02,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 05:17:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:02,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052980091] [2020-11-07 05:17:02,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:02,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:17:02,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51863249] [2020-11-07 05:17:02,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:17:02,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:17:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:17:02,866 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 10 states. [2020-11-07 05:17:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:03,180 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2020-11-07 05:17:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:17:03,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2020-11-07 05:17:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:03,184 INFO L225 Difference]: With dead ends: 129 [2020-11-07 05:17:03,184 INFO L226 Difference]: Without dead ends: 98 [2020-11-07 05:17:03,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:17:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-07 05:17:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2020-11-07 05:17:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-07 05:17:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-11-07 05:17:03,200 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 75 [2020-11-07 05:17:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:03,200 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-11-07 05:17:03,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:17:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-11-07 05:17:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-07 05:17:03,202 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:03,202 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:03,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:17:03,203 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1951741904, now seen corresponding path program 4 times [2020-11-07 05:17:03,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:03,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245947113] [2020-11-07 05:17:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:03,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:03,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 05:17:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:03,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245947113] [2020-11-07 05:17:03,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:03,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:17:03,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505652005] [2020-11-07 05:17:03,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:17:03,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:03,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:17:03,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:17:03,478 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 12 states. [2020-11-07 05:17:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:03,889 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2020-11-07 05:17:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:17:03,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2020-11-07 05:17:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:03,896 INFO L225 Difference]: With dead ends: 139 [2020-11-07 05:17:03,896 INFO L226 Difference]: Without dead ends: 108 [2020-11-07 05:17:03,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:17:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-07 05:17:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2020-11-07 05:17:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 05:17:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-11-07 05:17:03,911 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 85 [2020-11-07 05:17:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:03,912 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-11-07 05:17:03,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:17:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-11-07 05:17:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-07 05:17:03,914 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:03,914 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:03,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:17:03,914 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 120605546, now seen corresponding path program 5 times [2020-11-07 05:17:03,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:03,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765076034] [2020-11-07 05:17:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 05:17:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:04,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765076034] [2020-11-07 05:17:04,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:04,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:17:04,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864819324] [2020-11-07 05:17:04,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:17:04,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:04,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:17:04,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:17:04,195 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 14 states. [2020-11-07 05:17:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:04,616 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2020-11-07 05:17:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:17:04,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2020-11-07 05:17:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:04,619 INFO L225 Difference]: With dead ends: 149 [2020-11-07 05:17:04,619 INFO L226 Difference]: Without dead ends: 118 [2020-11-07 05:17:04,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:17:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-07 05:17:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2020-11-07 05:17:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-07 05:17:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-11-07 05:17:04,639 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 95 [2020-11-07 05:17:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:04,639 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-11-07 05:17:04,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:17:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-11-07 05:17:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 05:17:04,641 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:04,641 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:04,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:17:04,642 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1893521788, now seen corresponding path program 6 times [2020-11-07 05:17:04,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:04,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [659413601] [2020-11-07 05:17:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 05:17:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:04,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [659413601] [2020-11-07 05:17:04,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:04,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:17:04,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309028443] [2020-11-07 05:17:04,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:17:04,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:17:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:17:04,931 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 16 states. [2020-11-07 05:17:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:05,509 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2020-11-07 05:17:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:17:05,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-07 05:17:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:05,513 INFO L225 Difference]: With dead ends: 159 [2020-11-07 05:17:05,514 INFO L226 Difference]: Without dead ends: 128 [2020-11-07 05:17:05,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:17:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-07 05:17:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2020-11-07 05:17:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 05:17:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-11-07 05:17:05,533 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 105 [2020-11-07 05:17:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:05,533 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-11-07 05:17:05,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:17:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-11-07 05:17:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-07 05:17:05,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:05,536 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:05,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:17:05,536 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:05,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:05,537 INFO L82 PathProgramCache]: Analyzing trace with hash 347760926, now seen corresponding path program 7 times [2020-11-07 05:17:05,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:05,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711349854] [2020-11-07 05:17:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-07 05:17:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:05,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711349854] [2020-11-07 05:17:05,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:05,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:17:05,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467722166] [2020-11-07 05:17:05,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:17:05,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:17:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:17:05,906 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 18 states. [2020-11-07 05:17:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:06,498 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2020-11-07 05:17:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:17:06,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2020-11-07 05:17:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:06,503 INFO L225 Difference]: With dead ends: 169 [2020-11-07 05:17:06,503 INFO L226 Difference]: Without dead ends: 138 [2020-11-07 05:17:06,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:17:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-07 05:17:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2020-11-07 05:17:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-07 05:17:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2020-11-07 05:17:06,517 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 115 [2020-11-07 05:17:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:06,518 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2020-11-07 05:17:06,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:17:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2020-11-07 05:17:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-11-07 05:17:06,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:06,520 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:06,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:17:06,520 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:06,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1362801464, now seen corresponding path program 8 times [2020-11-07 05:17:06,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:06,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [442190455] [2020-11-07 05:17:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:06,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:06,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 05:17:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:06,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [442190455] [2020-11-07 05:17:06,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:06,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:17:06,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191606785] [2020-11-07 05:17:06,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:17:06,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:06,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:17:06,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:17:06,940 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 20 states. [2020-11-07 05:17:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:07,696 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2020-11-07 05:17:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:17:07,696 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 125 [2020-11-07 05:17:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:07,698 INFO L225 Difference]: With dead ends: 179 [2020-11-07 05:17:07,698 INFO L226 Difference]: Without dead ends: 148 [2020-11-07 05:17:07,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 05:17:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-11-07 05:17:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2020-11-07 05:17:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-07 05:17:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2020-11-07 05:17:07,730 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 125 [2020-11-07 05:17:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:07,731 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2020-11-07 05:17:07,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:17:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2020-11-07 05:17:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 05:17:07,743 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:07,744 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:07,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:17:07,744 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:07,745 INFO L82 PathProgramCache]: Analyzing trace with hash 681616594, now seen corresponding path program 9 times [2020-11-07 05:17:07,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:07,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941110720] [2020-11-07 05:17:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:08,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:08,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-07 05:17:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:08,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941110720] [2020-11-07 05:17:08,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:08,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:17:08,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836402656] [2020-11-07 05:17:08,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:17:08,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:17:08,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:17:08,143 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 22 states. [2020-11-07 05:17:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:08,898 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2020-11-07 05:17:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 05:17:08,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 135 [2020-11-07 05:17:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:08,901 INFO L225 Difference]: With dead ends: 189 [2020-11-07 05:17:08,901 INFO L226 Difference]: Without dead ends: 158 [2020-11-07 05:17:08,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 05:17:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-07 05:17:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2020-11-07 05:17:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-07 05:17:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2020-11-07 05:17:08,920 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 135 [2020-11-07 05:17:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:08,920 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2020-11-07 05:17:08,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:17:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2020-11-07 05:17:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 05:17:08,923 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:08,924 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:08,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:17:08,924 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:08,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1549738516, now seen corresponding path program 10 times [2020-11-07 05:17:08,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:08,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522977020] [2020-11-07 05:17:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:09,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:09,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-11-07 05:17:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:09,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522977020] [2020-11-07 05:17:09,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:09,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:17:09,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125345643] [2020-11-07 05:17:09,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:17:09,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:09,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:17:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:17:09,457 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 24 states. [2020-11-07 05:17:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:10,299 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2020-11-07 05:17:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-07 05:17:10,300 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 145 [2020-11-07 05:17:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:10,302 INFO L225 Difference]: With dead ends: 199 [2020-11-07 05:17:10,302 INFO L226 Difference]: Without dead ends: 168 [2020-11-07 05:17:10,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=605, Invalid=1287, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 05:17:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-11-07 05:17:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2020-11-07 05:17:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-11-07 05:17:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2020-11-07 05:17:10,319 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 145 [2020-11-07 05:17:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:10,319 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2020-11-07 05:17:10,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:17:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2020-11-07 05:17:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-11-07 05:17:10,321 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:10,322 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:10,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:17:10,322 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:10,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1772617350, now seen corresponding path program 11 times [2020-11-07 05:17:10,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:10,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078691624] [2020-11-07 05:17:10,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:10,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:10,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-11-07 05:17:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:10,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078691624] [2020-11-07 05:17:10,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:10,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 05:17:10,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683160070] [2020-11-07 05:17:10,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 05:17:10,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:10,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 05:17:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:17:10,874 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 26 states. [2020-11-07 05:17:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:11,737 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2020-11-07 05:17:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-07 05:17:11,737 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 155 [2020-11-07 05:17:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:11,739 INFO L225 Difference]: With dead ends: 209 [2020-11-07 05:17:11,740 INFO L226 Difference]: Without dead ends: 178 [2020-11-07 05:17:11,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=720, Invalid=1536, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 05:17:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-11-07 05:17:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2020-11-07 05:17:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-07 05:17:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2020-11-07 05:17:11,755 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 155 [2020-11-07 05:17:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:11,756 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2020-11-07 05:17:11,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 05:17:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2020-11-07 05:17:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-11-07 05:17:11,759 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:11,759 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:11,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:17:11,760 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1160075616, now seen corresponding path program 12 times [2020-11-07 05:17:11,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:11,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101028675] [2020-11-07 05:17:11,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:12,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:12,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-07 05:17:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:12,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101028675] [2020-11-07 05:17:12,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:12,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 05:17:12,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569918851] [2020-11-07 05:17:12,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 05:17:12,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 05:17:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:17:12,352 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 28 states. [2020-11-07 05:17:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:13,348 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2020-11-07 05:17:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-07 05:17:13,350 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 165 [2020-11-07 05:17:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:13,351 INFO L225 Difference]: With dead ends: 219 [2020-11-07 05:17:13,352 INFO L226 Difference]: Without dead ends: 188 [2020-11-07 05:17:13,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 05:17:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-07 05:17:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2020-11-07 05:17:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-07 05:17:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2020-11-07 05:17:13,368 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 165 [2020-11-07 05:17:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:13,368 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2020-11-07 05:17:13,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 05:17:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2020-11-07 05:17:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-11-07 05:17:13,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:13,371 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:13,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:17:13,372 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash -367692230, now seen corresponding path program 13 times [2020-11-07 05:17:13,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:13,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [208722600] [2020-11-07 05:17:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:13,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:13,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 05:17:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:14,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [208722600] [2020-11-07 05:17:14,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:14,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-11-07 05:17:14,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455106882] [2020-11-07 05:17:14,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 05:17:14,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:14,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 05:17:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2020-11-07 05:17:14,055 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 30 states. [2020-11-07 05:17:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:15,200 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2020-11-07 05:17:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-07 05:17:15,201 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 175 [2020-11-07 05:17:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:15,202 INFO L225 Difference]: With dead ends: 229 [2020-11-07 05:17:15,203 INFO L226 Difference]: Without dead ends: 198 [2020-11-07 05:17:15,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 05:17:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-07 05:17:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2020-11-07 05:17:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-11-07 05:17:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2020-11-07 05:17:15,215 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 175 [2020-11-07 05:17:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:15,216 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2020-11-07 05:17:15,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 05:17:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2020-11-07 05:17:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 05:17:15,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:15,218 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:15,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:17:15,219 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:15,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1458376020, now seen corresponding path program 14 times [2020-11-07 05:17:15,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:15,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059428925] [2020-11-07 05:17:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:15,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:15,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 05:17:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:15,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059428925] [2020-11-07 05:17:15,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:15,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2020-11-07 05:17:15,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368242668] [2020-11-07 05:17:15,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-07 05:17:15,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-07 05:17:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:17:15,892 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 32 states. [2020-11-07 05:17:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:17,017 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2020-11-07 05:17:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 05:17:17,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 185 [2020-11-07 05:17:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:17,019 INFO L225 Difference]: With dead ends: 239 [2020-11-07 05:17:17,020 INFO L226 Difference]: Without dead ends: 208 [2020-11-07 05:17:17,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1125, Invalid=2415, Unknown=0, NotChecked=0, Total=3540 [2020-11-07 05:17:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-11-07 05:17:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2020-11-07 05:17:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-07 05:17:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2020-11-07 05:17:17,038 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 185 [2020-11-07 05:17:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:17,038 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2020-11-07 05:17:17,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-07 05:17:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2020-11-07 05:17:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-11-07 05:17:17,041 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:17,041 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:17,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:17:17,042 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash -408024082, now seen corresponding path program 15 times [2020-11-07 05:17:17,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:17,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [896419994] [2020-11-07 05:17:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:17,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:17,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 05:17:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:17,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [896419994] [2020-11-07 05:17:17,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:17,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-11-07 05:17:17,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203225166] [2020-11-07 05:17:17,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-11-07 05:17:17,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:17,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-07 05:17:17,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:17:17,780 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 34 states. [2020-11-07 05:17:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:19,164 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2020-11-07 05:17:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-11-07 05:17:19,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 195 [2020-11-07 05:17:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:19,167 INFO L225 Difference]: With dead ends: 249 [2020-11-07 05:17:19,168 INFO L226 Difference]: Without dead ends: 218 [2020-11-07 05:17:19,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1280, Invalid=2752, Unknown=0, NotChecked=0, Total=4032 [2020-11-07 05:17:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-11-07 05:17:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2020-11-07 05:17:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 05:17:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2020-11-07 05:17:19,183 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 195 [2020-11-07 05:17:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:19,184 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2020-11-07 05:17:19,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-11-07 05:17:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2020-11-07 05:17:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-11-07 05:17:19,187 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:19,187 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:19,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:17:19,188 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:19,188 INFO L82 PathProgramCache]: Analyzing trace with hash 56431112, now seen corresponding path program 16 times [2020-11-07 05:17:19,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:19,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24001344] [2020-11-07 05:17:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:19,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:19,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-11-07 05:17:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:20,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24001344] [2020-11-07 05:17:20,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:20,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2020-11-07 05:17:20,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751265319] [2020-11-07 05:17:20,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-11-07 05:17:20,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-07 05:17:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 05:17:20,039 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 36 states. [2020-11-07 05:17:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:21,579 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2020-11-07 05:17:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-11-07 05:17:21,581 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 205 [2020-11-07 05:17:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:21,582 INFO L225 Difference]: With dead ends: 259 [2020-11-07 05:17:21,582 INFO L226 Difference]: Without dead ends: 228 [2020-11-07 05:17:21,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1445, Invalid=3111, Unknown=0, NotChecked=0, Total=4556 [2020-11-07 05:17:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-11-07 05:17:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 220. [2020-11-07 05:17:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-11-07 05:17:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2020-11-07 05:17:21,594 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 205 [2020-11-07 05:17:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:21,595 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2020-11-07 05:17:21,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-11-07 05:17:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2020-11-07 05:17:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-11-07 05:17:21,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:21,598 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:21,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:17:21,599 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 196525986, now seen corresponding path program 17 times [2020-11-07 05:17:21,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:21,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1269567203] [2020-11-07 05:17:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:22,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:22,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-11-07 05:17:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:22,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1269567203] [2020-11-07 05:17:22,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:22,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2020-11-07 05:17:22,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064471382] [2020-11-07 05:17:22,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-11-07 05:17:22,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-07 05:17:22,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 05:17:22,528 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 38 states. [2020-11-07 05:17:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:24,127 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2020-11-07 05:17:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-11-07 05:17:24,127 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 215 [2020-11-07 05:17:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:24,129 INFO L225 Difference]: With dead ends: 269 [2020-11-07 05:17:24,130 INFO L226 Difference]: Without dead ends: 238 [2020-11-07 05:17:24,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1620, Invalid=3492, Unknown=0, NotChecked=0, Total=5112 [2020-11-07 05:17:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-11-07 05:17:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2020-11-07 05:17:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-07 05:17:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2020-11-07 05:17:24,142 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 215 [2020-11-07 05:17:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:24,143 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2020-11-07 05:17:24,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-11-07 05:17:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2020-11-07 05:17:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-07 05:17:24,145 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:24,145 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:24,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 05:17:24,145 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1462744252, now seen corresponding path program 18 times [2020-11-07 05:17:24,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:24,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974076593] [2020-11-07 05:17:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:25,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:25,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-11-07 05:17:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:25,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974076593] [2020-11-07 05:17:25,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:25,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2020-11-07 05:17:25,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82779052] [2020-11-07 05:17:25,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-07 05:17:25,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-07 05:17:25,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 05:17:25,118 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 40 states. [2020-11-07 05:17:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:26,849 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2020-11-07 05:17:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-11-07 05:17:26,850 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 225 [2020-11-07 05:17:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:26,853 INFO L225 Difference]: With dead ends: 279 [2020-11-07 05:17:26,854 INFO L226 Difference]: Without dead ends: 248 [2020-11-07 05:17:26,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1805, Invalid=3895, Unknown=0, NotChecked=0, Total=5700 [2020-11-07 05:17:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-11-07 05:17:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2020-11-07 05:17:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-11-07 05:17:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2020-11-07 05:17:26,870 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 225 [2020-11-07 05:17:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:26,871 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2020-11-07 05:17:26,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-07 05:17:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2020-11-07 05:17:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-07 05:17:26,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:26,874 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:26,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 05:17:26,874 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1426812586, now seen corresponding path program 19 times [2020-11-07 05:17:26,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:26,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2092616446] [2020-11-07 05:17:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:27,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:27,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 05:17:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:27,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2092616446] [2020-11-07 05:17:27,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:27,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2020-11-07 05:17:27,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406253550] [2020-11-07 05:17:27,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-11-07 05:17:27,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-11-07 05:17:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1280, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 05:17:27,985 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 42 states. [2020-11-07 05:17:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:29,780 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2020-11-07 05:17:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2020-11-07 05:17:29,782 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 235 [2020-11-07 05:17:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:29,784 INFO L225 Difference]: With dead ends: 281 [2020-11-07 05:17:29,784 INFO L226 Difference]: Without dead ends: 250 [2020-11-07 05:17:29,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2000, Invalid=4320, Unknown=0, NotChecked=0, Total=6320 [2020-11-07 05:17:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-11-07 05:17:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2020-11-07 05:17:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-11-07 05:17:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2020-11-07 05:17:29,805 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 235 [2020-11-07 05:17:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:29,806 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2020-11-07 05:17:29,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-11-07 05:17:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2020-11-07 05:17:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-11-07 05:17:29,808 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:29,808 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:17:29,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 05:17:29,808 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 887747952, now seen corresponding path program 20 times [2020-11-07 05:17:29,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:29,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227436711] [2020-11-07 05:17:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:17:29,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:17:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:17:30,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:17:30,176 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:17:30,176 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:17:30,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 05:17:30,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:17:30 BoogieIcfgContainer [2020-11-07 05:17:30,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:17:30,315 INFO L168 Benchmark]: Toolchain (without parser) took 31052.02 ms. Allocated memory was 151.0 MB in the beginning and 402.7 MB in the end (delta: 251.7 MB). Free memory was 127.3 MB in the beginning and 326.3 MB in the end (delta: -198.9 MB). Peak memory consumption was 53.2 MB. Max. memory is 8.0 GB. [2020-11-07 05:17:30,316 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 151.0 MB. Free memory is still 126.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:17:30,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.00 ms. Allocated memory is still 151.0 MB. Free memory was 126.8 MB in the beginning and 117.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:17:30,317 INFO L168 Benchmark]: Boogie Preprocessor took 41.40 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 115.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:17:30,318 INFO L168 Benchmark]: RCFGBuilder took 656.75 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 132.1 MB in the end (delta: -16.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:17:30,321 INFO L168 Benchmark]: TraceAbstraction took 30029.07 ms. Allocated memory was 151.0 MB in the beginning and 402.7 MB in the end (delta: 251.7 MB). Free memory was 131.5 MB in the beginning and 326.8 MB in the end (delta: -195.3 MB). Peak memory consumption was 58.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:17:30,323 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.28 ms. Allocated memory is still 151.0 MB. Free memory is still 126.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 307.00 ms. Allocated memory is still 151.0 MB. Free memory was 126.8 MB in the beginning and 117.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.40 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 115.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 656.75 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 132.1 MB in the end (delta: -16.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 30029.07 ms. Allocated memory was 151.0 MB in the beginning and 402.7 MB in the end (delta: 251.7 MB). Free memory was 131.5 MB in the beginning and 326.8 MB in the end (delta: -195.3 MB). Peak memory consumption was 58.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] struct dummy ad1[20], *ad2; VAL [ad1={3:0}] [L18] int i, j, *pa; VAL [ad1={3:0}] [L19] j=0 VAL [ad1={3:0}, j=0] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=0] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, ad1={3:0}, j=0] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, ad1={3:0}, j=0] [L19] j++ VAL [ad1={3:0}, j=1] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=1] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, ad1={3:0}, j=1] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, ad1={3:0}, j=1] [L19] j++ VAL [ad1={3:0}, j=2] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=2] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, ad1={3:0}, j=2] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, ad1={3:0}, j=2] [L19] j++ VAL [ad1={3:0}, j=3] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=3] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-7, ad1={3:0}, j=3] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-8, ad1={3:0}, j=3] [L19] j++ VAL [ad1={3:0}, j=4] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=4] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, ad1={3:0}, j=4] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-9, ad1={3:0}, j=4] [L19] j++ VAL [ad1={3:0}, j=5] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=5] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=29, ad1={3:0}, j=5] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-11, ad1={3:0}, j=5] [L19] j++ VAL [ad1={3:0}, j=6] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=6] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-12, ad1={3:0}, j=6] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=13, ad1={3:0}, j=6] [L19] j++ VAL [ad1={3:0}, j=7] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=7] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-13, ad1={3:0}, j=7] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=14, ad1={3:0}, j=7] [L19] j++ VAL [ad1={3:0}, j=8] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=8] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-14, ad1={3:0}, j=8] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=15, ad1={3:0}, j=8] [L19] j++ VAL [ad1={3:0}, j=9] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=9] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-15, ad1={3:0}, j=9] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-16, ad1={3:0}, j=9] [L19] j++ VAL [ad1={3:0}, j=10] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=10] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=17, ad1={3:0}, j=10] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-17, ad1={3:0}, j=10] [L19] j++ VAL [ad1={3:0}, j=11] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=11] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=18, ad1={3:0}, j=11] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-18, ad1={3:0}, j=11] [L19] j++ VAL [ad1={3:0}, j=12] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=12] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=19, ad1={3:0}, j=12] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-19, ad1={3:0}, j=12] [L19] j++ VAL [ad1={3:0}, j=13] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=13] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-20, ad1={3:0}, j=13] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=21, ad1={3:0}, j=13] [L19] j++ VAL [ad1={3:0}, j=14] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=14] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-21, ad1={3:0}, j=14] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=22, ad1={3:0}, j=14] [L19] j++ VAL [ad1={3:0}, j=15] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=15] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-22, ad1={3:0}, j=15] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=23, ad1={3:0}, j=15] [L19] j++ VAL [ad1={3:0}, j=16] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=16] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-23, ad1={3:0}, j=16] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-24, ad1={3:0}, j=16] [L19] j++ VAL [ad1={3:0}, j=17] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=17] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=25, ad1={3:0}, j=17] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-25, ad1={3:0}, j=17] [L19] j++ VAL [ad1={3:0}, j=18] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=18] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=26, ad1={3:0}, j=18] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-26, ad1={3:0}, j=18] [L19] j++ VAL [ad1={3:0}, j=19] [L19] COND TRUE j<20 VAL [ad1={3:0}, j=19] [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=27, ad1={3:0}, j=19] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-27, ad1={3:0}, j=19] [L19] j++ VAL [ad1={3:0}, j=20] [L19] COND FALSE !(j<20) VAL [ad1={3:0}, j=20] [L23] i = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, ad1={3:0}, i=0, j=20] [L24] COND TRUE i >= 0 && i < 10 VAL [ad1={3:0}, i=0, j=20] [L25] ad2 = ad1 VAL [ad1={3:0}, ad2={3:0}, i=0, j=20] [L26] ad1[i].a = i VAL [ad1={3:0}, ad2={3:0}, i=0, j=20] [L27] pa = &ad1[i].a VAL [ad1={3:0}, ad2={3:0}, i=0, j=20, pa={3:0}] [L28] EXPR ad2[i].a VAL [ad1={3:0}, ad2={3:0}, ad2[i].a=0, i=0, j=20, pa={3:0}] [L28] i = ad2[i].a + 10 VAL [ad1={3:0}, ad2={3:0}, ad2[i].a=0, i=10, j=20, pa={3:0}] [L29] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={3:0}, ad2={3:0}, i=10, j=20, pa={3:0}] [L29] COND FALSE !(i < *pa) VAL [\read(*pa)=0, ad1={3:0}, ad2={3:0}, i=10, j=20, pa={3:0}] [L32] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={3:0}] [L12] EXPR ad1[b].a VAL [\old(b)=10, ad1={3:0}, ad1={3:0}, ad1[b].a=17, b=10] [L12] return ad1[b].a == b; VAL [\old(b)=10, \result=0, ad1={3:0}, ad1={3:0}, ad1[b].a=17, b=10] [L32] RET, EXPR check(ad1, i) VAL [ad1={3:0}, ad2={3:0}, check(ad1, i)=0, i=10, j=20, pa={3:0}] [L32] COND TRUE !check(ad1, i) VAL [ad1={3:0}, ad2={3:0}, check(ad1, i)=0, i=10, j=20, pa={3:0}] [L39] CALL reach_error() [L3] __assert_fail("0", "test24-2.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.7s, OverallIterations: 22, TraceHistogramMax: 20, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1149 SDtfs, 1877 SDslu, 14067 SDs, 0 SdLazy, 5871 SolverSat, 325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 801 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7391 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 152 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3088 NumberOfCodeBlocks, 3088 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2822 ConstructedInterpolants, 0 QuantifiedInterpolants, 1206104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 0/11590 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 incorrect! Received shutdown request...