/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:27:16,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:27:16,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:27:16,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:27:16,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:27:16,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:27:16,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:27:16,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:27:16,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:27:16,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:27:16,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:27:16,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:27:16,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:27:16,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:27:16,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:27:16,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:27:16,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:27:16,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:27:16,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:27:16,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:27:16,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:27:16,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:27:16,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:27:16,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:27:16,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:27:16,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:27:16,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:27:16,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:27:16,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:27:16,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:27:16,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:27:16,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:27:16,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:27:16,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:27:16,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:27:16,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:27:16,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:27:16,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:27:16,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:27:16,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:27:16,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:27:16,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:27:16,641 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:27:16,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:27:16,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:27:16,647 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:27:16,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:27:16,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:27:16,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:27:16,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:27:16,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:27:16,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:27:16,649 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:27:16,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:27:16,650 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:27:16,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:27:16,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:27:16,651 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:27:16,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:27:16,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:27:16,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:27:16,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:27:16,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:27:16,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:27:16,652 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 20:27:17,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:27:17,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:27:17,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:27:17,072 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:27:17,073 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:27:17,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-10-23 20:27:17,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c636860a1/1add311e187a4834916211cb789a0498/FLAG4553c3c4e [2020-10-23 20:27:17,759 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:27:17,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-10-23 20:27:17,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c636860a1/1add311e187a4834916211cb789a0498/FLAG4553c3c4e [2020-10-23 20:27:18,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c636860a1/1add311e187a4834916211cb789a0498 [2020-10-23 20:27:18,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:27:18,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:27:18,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:18,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:27:18,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:27:18,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22cbf8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18, skipping insertion in model container [2020-10-23 20:27:18,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:27:18,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:27:18,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:18,326 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:27:18,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:18,361 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:27:18,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18 WrapperNode [2020-10-23 20:27:18,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:18,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:27:18,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:27:18,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:27:18,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (1/1) ... [2020-10-23 20:27:18,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:27:18,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:27:18,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:27:18,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:27:18,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (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-10-23 20:27:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:27:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:27:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:27:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-23 20:27:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:27:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:27:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:27:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:27:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:27:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:27:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-23 20:27:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:27:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:27:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:27:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:27:18,991 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:27:18,992 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:27:18,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:18 BoogieIcfgContainer [2020-10-23 20:27:18,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:27:18,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:27:18,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:27:19,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:27:19,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:27:18" (1/3) ... [2020-10-23 20:27:19,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:19, skipping insertion in model container [2020-10-23 20:27:19,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:18" (2/3) ... [2020-10-23 20:27:19,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:19, skipping insertion in model container [2020-10-23 20:27:19,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:18" (3/3) ... [2020-10-23 20:27:19,005 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2020-10-23 20:27:19,018 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:27:19,024 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:27:19,039 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:27:19,063 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:27:19,063 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:27:19,064 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:27:19,064 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:27:19,064 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:27:19,064 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:27:19,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:27:19,064 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:27:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-23 20:27:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-23 20:27:19,122 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:19,123 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] [2020-10-23 20:27:19,124 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-23 20:27:19,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:19,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1659408091] [2020-10-23 20:27:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:19,224 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:27:19,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1659408091] [2020-10-23 20:27:19,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:19,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:27:19,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422212281] [2020-10-23 20:27:19,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:27:19,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:27:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:27:19,608 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-23 20:27:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:20,275 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-23 20:27:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:27:20,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-23 20:27:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:20,288 INFO L225 Difference]: With dead ends: 52 [2020-10-23 20:27:20,289 INFO L226 Difference]: Without dead ends: 32 [2020-10-23 20:27:20,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:27:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-23 20:27:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-23 20:27:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-23 20:27:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-23 20:27:20,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-23 20:27:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:20,355 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-23 20:27:20,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:27:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-23 20:27:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-23 20:27:20,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:20,358 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 20:27:20,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:27:20,358 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-23 20:27:20,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:20,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046641298] [2020-10-23 20:27:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:20,364 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-23 20:27:20,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046641298] [2020-10-23 20:27:20,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:20,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:27:20,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808951741] [2020-10-23 20:27:20,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:27:20,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:20,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:27:20,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:27:20,610 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-23 20:27:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:21,074 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-23 20:27:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:27:21,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-23 20:27:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:21,077 INFO L225 Difference]: With dead ends: 44 [2020-10-23 20:27:21,077 INFO L226 Difference]: Without dead ends: 37 [2020-10-23 20:27:21,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-23 20:27:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-23 20:27:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-23 20:27:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-23 20:27:21,094 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-23 20:27:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:21,095 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-23 20:27:21,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:27:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-23 20:27:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 20:27:21,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:21,097 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-10-23 20:27:21,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:27:21,098 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-23 20:27:21,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:21,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326655749] [2020-10-23 20:27:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:21,103 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-23 20:27:21,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326655749] [2020-10-23 20:27:21,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:21,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:27:21,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471867559] [2020-10-23 20:27:21,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:27:21,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:21,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:27:21,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:27:21,374 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-23 20:27:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:21,852 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-23 20:27:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:27:21,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-23 20:27:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:21,855 INFO L225 Difference]: With dead ends: 49 [2020-10-23 20:27:21,855 INFO L226 Difference]: Without dead ends: 42 [2020-10-23 20:27:21,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-23 20:27:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-23 20:27:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-23 20:27:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-23 20:27:21,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-23 20:27:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:21,870 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-23 20:27:21,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:27:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-23 20:27:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-23 20:27:21,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:21,872 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-10-23 20:27:21,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:27:21,873 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:21,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-23 20:27:21,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:21,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1713362062] [2020-10-23 20:27:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:21,877 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-23 20:27:22,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1713362062] [2020-10-23 20:27:22,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:22,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:27:22,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513444593] [2020-10-23 20:27:22,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:27:22,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:27:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:22,266 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-23 20:27:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:22,879 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-23 20:27:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:27:22,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-23 20:27:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:22,882 INFO L225 Difference]: With dead ends: 54 [2020-10-23 20:27:22,882 INFO L226 Difference]: Without dead ends: 47 [2020-10-23 20:27:22,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-23 20:27:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-23 20:27:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-23 20:27:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-23 20:27:22,902 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-23 20:27:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:22,902 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-23 20:27:22,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:27:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-23 20:27:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-23 20:27:22,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:22,905 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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] [2020-10-23 20:27:22,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:27:22,905 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-23 20:27:22,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:22,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788616656] [2020-10-23 20:27:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:22,910 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-23 20:27:23,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788616656] [2020-10-23 20:27:23,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:23,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:27:23,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044581850] [2020-10-23 20:27:23,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:27:23,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:23,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:27:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:27:23,196 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-23 20:27:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:23,903 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-23 20:27:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:27:23,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-23 20:27:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:23,906 INFO L225 Difference]: With dead ends: 59 [2020-10-23 20:27:23,906 INFO L226 Difference]: Without dead ends: 52 [2020-10-23 20:27:23,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-23 20:27:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-23 20:27:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-23 20:27:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-23 20:27:23,923 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-23 20:27:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:23,923 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-23 20:27:23,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:27:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-23 20:27:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 20:27:23,926 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:23,926 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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] [2020-10-23 20:27:23,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:27:23,926 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-23 20:27:23,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:23,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [491119158] [2020-10-23 20:27:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:23,932 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-23 20:27:24,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [491119158] [2020-10-23 20:27:24,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:24,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:27:24,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921286793] [2020-10-23 20:27:24,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:27:24,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:24,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:27:24,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:24,273 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-23 20:27:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:25,074 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-23 20:27:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:27:25,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-23 20:27:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:25,078 INFO L225 Difference]: With dead ends: 64 [2020-10-23 20:27:25,078 INFO L226 Difference]: Without dead ends: 57 [2020-10-23 20:27:25,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-23 20:27:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-23 20:27:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-23 20:27:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-23 20:27:25,100 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-23 20:27:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:25,101 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-23 20:27:25,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:27:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-23 20:27:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 20:27:25,103 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:25,103 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 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] [2020-10-23 20:27:25,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:27:25,104 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-23 20:27:25,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:25,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387268829] [2020-10-23 20:27:25,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:25,109 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-23 20:27:25,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387268829] [2020-10-23 20:27:25,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:25,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:27:25,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723363993] [2020-10-23 20:27:25,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:27:25,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:25,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:27:25,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:27:25,484 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-23 20:27:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:26,447 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-23 20:27:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:27:26,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-23 20:27:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:26,452 INFO L225 Difference]: With dead ends: 69 [2020-10-23 20:27:26,452 INFO L226 Difference]: Without dead ends: 62 [2020-10-23 20:27:26,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:27:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-23 20:27:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-23 20:27:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-23 20:27:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-23 20:27:26,468 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-23 20:27:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:26,469 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-23 20:27:26,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:27:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-23 20:27:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:27:26,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:26,471 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2020-10-23 20:27:26,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:27:26,471 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-23 20:27:26,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:26,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391022131] [2020-10-23 20:27:26,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:26,477 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-23 20:27:26,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391022131] [2020-10-23 20:27:26,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:26,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:27:26,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554709273] [2020-10-23 20:27:26,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:27:26,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:26,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:27:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:26,973 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-23 20:27:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:27,871 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-23 20:27:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:27:27,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-23 20:27:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:27,873 INFO L225 Difference]: With dead ends: 74 [2020-10-23 20:27:27,874 INFO L226 Difference]: Without dead ends: 67 [2020-10-23 20:27:27,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:27:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-23 20:27:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-23 20:27:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-23 20:27:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-23 20:27:27,906 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-23 20:27:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:27,907 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-23 20:27:27,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:27:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-23 20:27:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-23 20:27:27,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:27,916 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 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] [2020-10-23 20:27:27,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:27:27,916 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-23 20:27:27,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:27,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920195409] [2020-10-23 20:27:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:27,924 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-23 20:27:28,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920195409] [2020-10-23 20:27:28,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:28,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:27:28,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103514339] [2020-10-23 20:27:28,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:27:28,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:27:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:27:28,369 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-23 20:27:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:29,338 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-23 20:27:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:27:29,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-23 20:27:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:29,346 INFO L225 Difference]: With dead ends: 79 [2020-10-23 20:27:29,346 INFO L226 Difference]: Without dead ends: 72 [2020-10-23 20:27:29,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:27:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-23 20:27:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-23 20:27:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-23 20:27:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-23 20:27:29,375 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-23 20:27:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:29,376 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-23 20:27:29,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:27:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-23 20:27:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-23 20:27:29,383 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:29,383 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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] [2020-10-23 20:27:29,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:27:29,384 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:29,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-23 20:27:29,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:29,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064113804] [2020-10-23 20:27:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:29,390 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-23 20:27:29,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064113804] [2020-10-23 20:27:29,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:29,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:27:29,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550735796] [2020-10-23 20:27:29,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:27:29,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:27:29,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:29,907 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-23 20:27:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:31,013 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-23 20:27:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:27:31,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-23 20:27:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:31,016 INFO L225 Difference]: With dead ends: 84 [2020-10-23 20:27:31,016 INFO L226 Difference]: Without dead ends: 77 [2020-10-23 20:27:31,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:27:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-23 20:27:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-23 20:27:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-23 20:27:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-23 20:27:31,064 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-23 20:27:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:31,066 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-23 20:27:31,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:27:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-23 20:27:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-23 20:27:31,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:31,069 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 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] [2020-10-23 20:27:31,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:27:31,069 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:31,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-23 20:27:31,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:31,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1016047734] [2020-10-23 20:27:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:31,077 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-23 20:27:31,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1016047734] [2020-10-23 20:27:31,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:31,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:27:31,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473984218] [2020-10-23 20:27:31,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:27:31,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:27:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:27:31,628 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-23 20:27:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:32,763 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-23 20:27:32,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:27:32,764 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-23 20:27:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:32,765 INFO L225 Difference]: With dead ends: 89 [2020-10-23 20:27:32,765 INFO L226 Difference]: Without dead ends: 82 [2020-10-23 20:27:32,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:27:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-23 20:27:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-23 20:27:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-23 20:27:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-23 20:27:32,780 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-23 20:27:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:32,781 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-23 20:27:32,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:27:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-23 20:27:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-23 20:27:32,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:32,783 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 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] [2020-10-23 20:27:32,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:27:32,783 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-23 20:27:32,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:32,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1853920213] [2020-10-23 20:27:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:32,790 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-23 20:27:33,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1853920213] [2020-10-23 20:27:33,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:33,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:27:33,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878728349] [2020-10-23 20:27:33,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:27:33,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:33,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:27:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:33,453 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-23 20:27:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:34,786 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-23 20:27:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:27:34,787 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-23 20:27:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:34,789 INFO L225 Difference]: With dead ends: 94 [2020-10-23 20:27:34,789 INFO L226 Difference]: Without dead ends: 87 [2020-10-23 20:27:34,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-23 20:27:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-23 20:27:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-23 20:27:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-23 20:27:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-23 20:27:34,806 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-23 20:27:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:34,807 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-23 20:27:34,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:27:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-23 20:27:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-23 20:27:34,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:34,809 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 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] [2020-10-23 20:27:34,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:27:34,809 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:34,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-23 20:27:34,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:34,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260666311] [2020-10-23 20:27:34,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:34,817 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:34,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-23 20:27:35,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260666311] [2020-10-23 20:27:35,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:35,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:27:35,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211121706] [2020-10-23 20:27:35,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:27:35,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:27:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:27:35,534 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-23 20:27:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:36,937 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-23 20:27:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:27:36,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-23 20:27:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:36,939 INFO L225 Difference]: With dead ends: 99 [2020-10-23 20:27:36,939 INFO L226 Difference]: Without dead ends: 92 [2020-10-23 20:27:36,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:27:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-23 20:27:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-23 20:27:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-23 20:27:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-23 20:27:36,965 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-23 20:27:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:36,965 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-23 20:27:36,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:27:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-23 20:27:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-23 20:27:36,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:36,968 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 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] [2020-10-23 20:27:36,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:27:36,969 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-23 20:27:36,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:36,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [784260644] [2020-10-23 20:27:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:36,984 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-23 20:27:37,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [784260644] [2020-10-23 20:27:37,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:37,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:27:37,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480843299] [2020-10-23 20:27:37,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:27:37,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:27:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:37,783 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-23 20:27:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:39,249 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-23 20:27:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:27:39,250 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-23 20:27:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:39,252 INFO L225 Difference]: With dead ends: 104 [2020-10-23 20:27:39,252 INFO L226 Difference]: Without dead ends: 97 [2020-10-23 20:27:39,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:27:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-23 20:27:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-23 20:27:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-23 20:27:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-23 20:27:39,268 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-23 20:27:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:39,268 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-23 20:27:39,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:27:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-23 20:27:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-23 20:27:39,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:39,270 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 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] [2020-10-23 20:27:39,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:27:39,271 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-23 20:27:39,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:39,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129756555] [2020-10-23 20:27:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:39,279 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-23 20:27:40,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [129756555] [2020-10-23 20:27:40,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:40,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:27:40,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358073651] [2020-10-23 20:27:40,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:27:40,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:40,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:27:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:27:40,150 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-23 20:27:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:41,724 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-23 20:27:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:27:41,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-23 20:27:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:41,726 INFO L225 Difference]: With dead ends: 109 [2020-10-23 20:27:41,726 INFO L226 Difference]: Without dead ends: 102 [2020-10-23 20:27:41,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 20:27:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-23 20:27:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-23 20:27:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-23 20:27:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-23 20:27:41,742 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-23 20:27:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:41,743 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-23 20:27:41,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:27:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-23 20:27:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-23 20:27:41,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:41,745 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 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] [2020-10-23 20:27:41,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:27:41,745 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-23 20:27:41,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:41,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334904429] [2020-10-23 20:27:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:41,755 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:41,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-10-23 20:27:42,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334904429] [2020-10-23 20:27:42,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:42,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-10-23 20:27:42,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153999658] [2020-10-23 20:27:42,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-23 20:27:42,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-23 20:27:42,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:27:42,769 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-10-23 20:27:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:44,483 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-10-23 20:27:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 20:27:44,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-10-23 20:27:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:44,486 INFO L225 Difference]: With dead ends: 114 [2020-10-23 20:27:44,486 INFO L226 Difference]: Without dead ends: 107 [2020-10-23 20:27:44,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-10-23 20:27:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-23 20:27:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-23 20:27:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-23 20:27:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-23 20:27:44,503 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-10-23 20:27:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:44,503 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-23 20:27:44,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-23 20:27:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-23 20:27:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:27:44,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:44,506 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 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] [2020-10-23 20:27:44,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:27:44,506 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-10-23 20:27:44,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:44,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [794183816] [2020-10-23 20:27:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:44,511 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:44,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-10-23 20:27:45,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [794183816] [2020-10-23 20:27:45,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:45,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-10-23 20:27:45,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438024340] [2020-10-23 20:27:45,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-23 20:27:45,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-23 20:27:45,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:27:45,637 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-10-23 20:27:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:47,442 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-10-23 20:27:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-23 20:27:47,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-10-23 20:27:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:47,450 INFO L225 Difference]: With dead ends: 119 [2020-10-23 20:27:47,451 INFO L226 Difference]: Without dead ends: 112 [2020-10-23 20:27:47,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 20:27:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-23 20:27:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-23 20:27:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-23 20:27:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-10-23 20:27:47,466 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-10-23 20:27:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:47,466 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-10-23 20:27:47,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-23 20:27:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-10-23 20:27:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-10-23 20:27:47,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:47,468 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 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] [2020-10-23 20:27:47,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 20:27:47,469 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:47,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-10-23 20:27:47,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:47,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433977972] [2020-10-23 20:27:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:47,474 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:47,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-10-23 20:27:48,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433977972] [2020-10-23 20:27:48,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:48,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-10-23 20:27:48,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623990016] [2020-10-23 20:27:48,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-23 20:27:48,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-23 20:27:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:27:48,598 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-10-23 20:27:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:50,582 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-10-23 20:27:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 20:27:50,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-10-23 20:27:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:50,588 INFO L225 Difference]: With dead ends: 124 [2020-10-23 20:27:50,588 INFO L226 Difference]: Without dead ends: 117 [2020-10-23 20:27:50,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-23 20:27:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-23 20:27:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-10-23 20:27:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-23 20:27:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-10-23 20:27:50,608 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-10-23 20:27:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:50,609 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-10-23 20:27:50,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-23 20:27:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-10-23 20:27:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-23 20:27:50,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:50,611 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 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] [2020-10-23 20:27:50,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 20:27:50,612 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-10-23 20:27:50,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:50,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028197222] [2020-10-23 20:27:50,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:50,619 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:50,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-10-23 20:27:51,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028197222] [2020-10-23 20:27:51,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:51,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-10-23 20:27:51,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605809785] [2020-10-23 20:27:51,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-23 20:27:51,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:51,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-23 20:27:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-23 20:27:51,835 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-10-23 20:27:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:53,846 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-10-23 20:27:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-23 20:27:53,847 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-10-23 20:27:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:53,848 INFO L225 Difference]: With dead ends: 129 [2020-10-23 20:27:53,848 INFO L226 Difference]: Without dead ends: 122 [2020-10-23 20:27:53,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-23 20:27:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-23 20:27:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-23 20:27:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-23 20:27:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-10-23 20:27:53,867 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-10-23 20:27:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:53,867 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-10-23 20:27:53,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-23 20:27:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-10-23 20:27:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-23 20:27:53,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:53,869 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 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] [2020-10-23 20:27:53,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 20:27:53,869 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:53,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-10-23 20:27:53,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:53,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022793100] [2020-10-23 20:27:53,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:53,875 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:53,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:54,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-10-23 20:27:55,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022793100] [2020-10-23 20:27:55,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:55,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-10-23 20:27:55,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748417848] [2020-10-23 20:27:55,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-23 20:27:55,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-23 20:27:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:27:55,103 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-10-23 20:27:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:57,273 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-10-23 20:27:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-23 20:27:57,274 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-10-23 20:27:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:57,276 INFO L225 Difference]: With dead ends: 134 [2020-10-23 20:27:57,276 INFO L226 Difference]: Without dead ends: 127 [2020-10-23 20:27:57,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-23 20:27:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-23 20:27:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-23 20:27:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-23 20:27:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-10-23 20:27:57,294 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-10-23 20:27:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:57,294 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-10-23 20:27:57,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-23 20:27:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-10-23 20:27:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-23 20:27:57,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:57,296 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 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] [2020-10-23 20:27:57,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-23 20:27:57,296 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:57,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-10-23 20:27:57,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:57,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [290869116] [2020-10-23 20:27:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:57,301 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 20:27:57,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 20:27:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 20:27:57,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 20:27:57,430 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-23 20:27:57,430 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 20:27:57,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-23 20:27:57,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:27:57 BoogieIcfgContainer [2020-10-23 20:27:57,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:27:57,459 INFO L168 Benchmark]: Toolchain (without parser) took 39344.01 ms. Allocated memory was 155.2 MB in the beginning and 360.7 MB in the end (delta: 205.5 MB). Free memory was 131.1 MB in the beginning and 291.1 MB in the end (delta: -160.0 MB). Peak memory consumption was 46.8 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:57,460 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 155.2 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:27:57,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.74 ms. Allocated memory is still 155.2 MB. Free memory was 130.5 MB in the beginning and 121.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:57,461 INFO L168 Benchmark]: Boogie Preprocessor took 34.08 ms. Allocated memory is still 155.2 MB. Free memory was 121.0 MB in the beginning and 119.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:57,461 INFO L168 Benchmark]: RCFGBuilder took 596.39 ms. Allocated memory is still 155.2 MB. Free memory was 119.6 MB in the beginning and 106.7 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:57,462 INFO L168 Benchmark]: TraceAbstraction took 38460.88 ms. Allocated memory was 155.2 MB in the beginning and 360.7 MB in the end (delta: 205.5 MB). Free memory was 106.3 MB in the beginning and 291.1 MB in the end (delta: -184.8 MB). Peak memory consumption was 21.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:57,464 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.20 ms. Allocated memory is still 155.2 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 240.74 ms. Allocated memory is still 155.2 MB. Free memory was 130.5 MB in the beginning and 121.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.08 ms. Allocated memory is still 155.2 MB. Free memory was 121.0 MB in the beginning and 119.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 596.39 ms. Allocated memory is still 155.2 MB. Free memory was 119.6 MB in the beginning and 106.7 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 38460.88 ms. Allocated memory was 155.2 MB in the beginning and 360.7 MB in the end (delta: 205.5 MB). Free memory was 106.3 MB in the beginning and 291.1 MB in the end (delta: -184.8 MB). Peak memory consumption was 21.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 20; [L13] CALL, EXPR id(input) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND TRUE x==0 [L7] return 0; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) [L13] int result = id(input); [L14] COND TRUE result == 20 [L15] CALL reach_error() [L4] __assert_fail("0", "id_i20_o20-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.3s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 543 SDtfs, 2095 SDslu, 1236 SDs, 0 SdLazy, 2217 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3083 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...