/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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.1.25-3af5e1f [2020-09-04 16:29:34,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:29:34,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:29:34,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:29:34,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:29:34,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:29:34,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:29:34,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:29:34,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:29:34,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:29:34,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:29:34,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:29:34,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:29:34,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:29:34,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:29:34,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:29:34,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:29:34,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:29:34,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:29:34,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:29:34,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:29:34,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:29:34,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:29:34,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:29:34,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:29:34,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:29:34,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:29:34,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:29:34,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:29:34,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:29:34,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:29:34,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:29:34,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:29:34,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:29:34,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:29:34,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:29:34,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:29:34,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:29:34,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:29:34,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:29:34,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:29:34,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:29:34,821 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:29:34,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:29:34,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:29:34,825 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:29:34,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:29:34,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:29:34,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:29:34,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:29:34,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:29:34,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:29:34,827 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:29:34,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:29:34,828 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:29:34,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:29:34,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:29:34,829 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:29:34,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:29:34,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:29:34,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:29:34,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:29:34,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:29:34,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:29:34,830 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:29:35,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:29:35,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:29:35,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:29:35,428 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:29:35,429 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:29:35,430 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-09-04 16:29:35,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/16932f62d/5b3797f511aa40e89ab81df0d9fb32d4/FLAGa6c735bcb [2020-09-04 16:29:36,155 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:29:36,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-09-04 16:29:36,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/16932f62d/5b3797f511aa40e89ab81df0d9fb32d4/FLAGa6c735bcb [2020-09-04 16:29:36,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/16932f62d/5b3797f511aa40e89ab81df0d9fb32d4 [2020-09-04 16:29:36,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:29:36,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:29:36,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:36,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:29:36,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:29:36,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3250662d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36, skipping insertion in model container [2020-09-04 16:29:36,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:29:36,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:29:36,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:36,788 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:29:36,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:36,825 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:29:36,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36 WrapperNode [2020-09-04 16:29:36,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:36,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:29:36,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:29:36,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:29:36,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... [2020-09-04 16:29:36,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:29:36,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:29:36,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:29:36,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:29:36,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 16:29:37,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:29:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:29:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:29:37,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:29:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:29:37,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:29:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:29:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:29:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:29:37,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:29:37,276 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:29:37,276 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:29:37,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:37 BoogieIcfgContainer [2020-09-04 16:29:37,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:29:37,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:29:37,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:29:37,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:29:37,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:29:36" (1/3) ... [2020-09-04 16:29:37,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3699d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:37, skipping insertion in model container [2020-09-04 16:29:37,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:36" (2/3) ... [2020-09-04 16:29:37,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3699d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:37, skipping insertion in model container [2020-09-04 16:29:37,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:37" (3/3) ... [2020-09-04 16:29:37,292 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2020-09-04 16:29:37,304 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:29:37,315 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:29:37,336 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:29:37,365 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:29:37,366 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:29:37,366 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:29:37,366 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:29:37,366 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:29:37,368 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:29:37,368 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:29:37,368 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:29:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 16:29:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:29:37,409 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:37,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:37,411 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 16:29:37,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:37,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290287475] [2020-09-04 16:29:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:37,503 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:37,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:37,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:29:37,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290287475] [2020-09-04 16:29:37,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:37,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:29:37,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844295570] [2020-09-04 16:29:37,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:29:37,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:37,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:29:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:29:37,840 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 16:29:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:37,941 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 16:29:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:29:37,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:29:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:37,958 INFO L225 Difference]: With dead ends: 37 [2020-09-04 16:29:37,959 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 16:29:37,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:29:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 16:29:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 16:29:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 16:29:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 16:29:38,018 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 16:29:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:38,019 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 16:29:38,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:29:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 16:29:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:29:38,022 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:38,022 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] [2020-09-04 16:29:38,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:29:38,023 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 16:29:38,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:38,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [882751081] [2020-09-04 16:29:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:38,027 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:29:38,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [882751081] [2020-09-04 16:29:38,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:38,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:29:38,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440245048] [2020-09-04 16:29:38,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:29:38,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:38,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:29:38,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:29:38,183 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 16:29:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:38,251 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 16:29:38,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:29:38,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 16:29:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:38,254 INFO L225 Difference]: With dead ends: 34 [2020-09-04 16:29:38,254 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:29:38,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:29:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:29:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:29:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:29:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 16:29:38,269 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 16:29:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:38,269 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 16:29:38,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:29:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 16:29:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 16:29:38,271 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:38,272 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] [2020-09-04 16:29:38,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:29:38,272 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 16:29:38,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:38,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286522234] [2020-09-04 16:29:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:38,276 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:29:38,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286522234] [2020-09-04 16:29:38,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:38,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:29:38,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624413897] [2020-09-04 16:29:38,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:29:38,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:38,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:29:38,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:29:38,483 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 16:29:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:38,644 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 16:29:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:29:38,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 16:29:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:38,650 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:29:38,650 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:29:38,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:29:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:29:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 16:29:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 16:29:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 16:29:38,679 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 16:29:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:38,682 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 16:29:38,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:29:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 16:29:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 16:29:38,687 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:38,687 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] [2020-09-04 16:29:38,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:29:38,688 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:38,690 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 16:29:38,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:38,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077629011] [2020-09-04 16:29:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:38,696 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:38,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 16:29:39,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1077629011] [2020-09-04 16:29:39,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:39,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:29:39,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141857245] [2020-09-04 16:29:39,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:29:39,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:29:39,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:29:39,049 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 16:29:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:39,146 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 16:29:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:29:39,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 16:29:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:39,149 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:29:39,149 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 16:29:39,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 16:29:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 16:29:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 16:29:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 16:29:39,162 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 16:29:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:39,163 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 16:29:39,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:29:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 16:29:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:29:39,165 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:39,165 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] [2020-09-04 16:29:39,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:29:39,166 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 16:29:39,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:39,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281096681] [2020-09-04 16:29:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:39,170 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 16:29:39,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281096681] [2020-09-04 16:29:39,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:39,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:29:39,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796424369] [2020-09-04 16:29:39,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:29:39,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:29:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:29:39,403 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 16:29:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:39,501 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 16:29:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:29:39,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 16:29:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:39,503 INFO L225 Difference]: With dead ends: 49 [2020-09-04 16:29:39,504 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:29:39,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:29:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:29:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:29:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 16:29:39,520 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 16:29:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:39,523 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 16:29:39,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:29:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 16:29:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:29:39,525 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:39,525 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] [2020-09-04 16:29:39,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:29:39,530 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 16:29:39,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:39,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429220973] [2020-09-04 16:29:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:39,537 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 16:29:39,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429220973] [2020-09-04 16:29:39,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:39,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:29:39,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454072850] [2020-09-04 16:29:39,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:29:39,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:29:39,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:29:39,868 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 16:29:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:39,999 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 16:29:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:29:40,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 16:29:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:40,003 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:29:40,003 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 16:29:40,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:29:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 16:29:40,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 16:29:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 16:29:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 16:29:40,018 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 16:29:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:40,019 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 16:29:40,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:29:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 16:29:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:29:40,021 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:40,022 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] [2020-09-04 16:29:40,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:29:40,022 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 16:29:40,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:40,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [352536708] [2020-09-04 16:29:40,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:40,027 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 16:29:40,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [352536708] [2020-09-04 16:29:40,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:40,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:29:40,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582551784] [2020-09-04 16:29:40,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:29:40,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:29:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:29:40,335 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 16:29:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:40,470 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 16:29:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:29:40,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 16:29:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:40,473 INFO L225 Difference]: With dead ends: 59 [2020-09-04 16:29:40,473 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 16:29:40,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:29:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 16:29:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 16:29:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 16:29:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 16:29:40,486 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 16:29:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:40,487 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 16:29:40,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:29:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 16:29:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:29:40,488 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:40,489 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] [2020-09-04 16:29:40,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:29:40,489 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 16:29:40,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:40,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657165329] [2020-09-04 16:29:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:40,493 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 16:29:40,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657165329] [2020-09-04 16:29:40,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:40,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:29:40,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832785190] [2020-09-04 16:29:40,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:29:40,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:40,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:29:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:40,793 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 16:29:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:40,948 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 16:29:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:29:40,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 16:29:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:40,950 INFO L225 Difference]: With dead ends: 64 [2020-09-04 16:29:40,951 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 16:29:40,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:29:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 16:29:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 16:29:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 16:29:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 16:29:40,963 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 16:29:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:40,963 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 16:29:40,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:29:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 16:29:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 16:29:40,965 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:40,965 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] [2020-09-04 16:29:40,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:29:40,966 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:40,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 16:29:40,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:40,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858299723] [2020-09-04 16:29:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:40,969 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 16:29:41,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858299723] [2020-09-04 16:29:41,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:41,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:29:41,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273319753] [2020-09-04 16:29:41,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:29:41,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:29:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:29:41,332 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 16:29:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:41,497 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 16:29:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:29:41,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 16:29:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:41,501 INFO L225 Difference]: With dead ends: 69 [2020-09-04 16:29:41,501 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 16:29:41,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:29:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 16:29:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 16:29:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 16:29:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 16:29:41,521 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 16:29:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:41,521 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 16:29:41,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:29:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 16:29:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 16:29:41,525 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:41,525 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] [2020-09-04 16:29:41,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:29:41,526 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 16:29:41,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:41,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191644802] [2020-09-04 16:29:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:41,532 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:41,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 16:29:42,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191644802] [2020-09-04 16:29:42,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:42,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:29:42,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494459277] [2020-09-04 16:29:42,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:29:42,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:29:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:42,097 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 16:29:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:42,332 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 16:29:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:29:42,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 16:29:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:42,334 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:29:42,335 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:29:42,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:29:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:29:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 16:29:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 16:29:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 16:29:42,360 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 16:29:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:42,360 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 16:29:42,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:29:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 16:29:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 16:29:42,362 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:42,362 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] [2020-09-04 16:29:42,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:29:42,363 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:42,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 16:29:42,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:42,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114762162] [2020-09-04 16:29:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:42,368 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 16:29:42,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114762162] [2020-09-04 16:29:42,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:42,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:29:42,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011976165] [2020-09-04 16:29:42,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:29:42,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:29:42,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:29:42,979 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 16:29:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:43,176 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 16:29:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:29:43,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 16:29:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:43,179 INFO L225 Difference]: With dead ends: 79 [2020-09-04 16:29:43,179 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:29:43,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:29:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:29:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 16:29:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 16:29:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 16:29:43,194 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 16:29:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:43,194 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 16:29:43,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:29:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 16:29:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 16:29:43,196 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:43,197 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] [2020-09-04 16:29:43,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:29:43,197 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 16:29:43,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:43,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471736168] [2020-09-04 16:29:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:43,201 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 16:29:43,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471736168] [2020-09-04 16:29:43,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:43,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:29:43,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177807102] [2020-09-04 16:29:43,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:29:43,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:43,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:29:43,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:29:43,879 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 16:29:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:44,120 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 16:29:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:29:44,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 16:29:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:44,124 INFO L225 Difference]: With dead ends: 84 [2020-09-04 16:29:44,124 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:29:44,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:29:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:29:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 16:29:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 16:29:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 16:29:44,140 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 16:29:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:44,141 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 16:29:44,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:29:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 16:29:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 16:29:44,144 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:44,144 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] [2020-09-04 16:29:44,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:29:44,145 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 16:29:44,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:44,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492734986] [2020-09-04 16:29:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:44,150 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 16:29:44,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492734986] [2020-09-04 16:29:44,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:44,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:29:44,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838642438] [2020-09-04 16:29:44,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:29:44,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:29:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:29:44,850 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 16:29:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:45,053 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 16:29:45,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:29:45,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 16:29:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:45,056 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:29:45,056 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 16:29:45,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:29:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 16:29:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 16:29:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 16:29:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 16:29:45,068 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 16:29:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:45,068 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 16:29:45,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:29:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 16:29:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 16:29:45,070 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:45,070 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] [2020-09-04 16:29:45,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:29:45,071 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 16:29:45,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:45,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976593404] [2020-09-04 16:29:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:45,074 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 16:29:45,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976593404] [2020-09-04 16:29:45,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:45,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:29:45,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013232098] [2020-09-04 16:29:45,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:29:45,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:29:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:29:45,905 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 16:29:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:46,192 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 16:29:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:29:46,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 16:29:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:46,195 INFO L225 Difference]: With dead ends: 94 [2020-09-04 16:29:46,195 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 16:29:46,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-04 16:29:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 16:29:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 16:29:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 16:29:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 16:29:46,206 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 16:29:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:46,207 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 16:29:46,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:29:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 16:29:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:29:46,209 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:46,209 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] [2020-09-04 16:29:46,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:29:46,210 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 16:29:46,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:46,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98346863] [2020-09-04 16:29:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:46,213 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 16:29:46,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98346863] [2020-09-04 16:29:46,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:46,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:29:46,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200145631] [2020-09-04 16:29:46,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:29:46,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:29:46,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:29:46,996 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 16:29:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:47,256 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 16:29:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:29:47,257 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 16:29:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:47,258 INFO L225 Difference]: With dead ends: 99 [2020-09-04 16:29:47,259 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 16:29:47,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:29:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 16:29:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 16:29:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 16:29:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 16:29:47,278 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 16:29:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:47,280 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 16:29:47,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:29:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 16:29:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 16:29:47,282 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:47,282 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] [2020-09-04 16:29:47,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:29:47,283 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 16:29:47,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:47,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345631163] [2020-09-04 16:29:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:47,287 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:47,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-04 16:29:48,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345631163] [2020-09-04 16:29:48,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:48,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:29:48,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702447968] [2020-09-04 16:29:48,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:29:48,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:29:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:29:48,353 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 20 states. [2020-09-04 16:29:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:48,609 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-09-04 16:29:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:29:48,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 136 [2020-09-04 16:29:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:48,612 INFO L225 Difference]: With dead ends: 104 [2020-09-04 16:29:48,612 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 16:29:48,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 16:29:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 16:29:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 16:29:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 16:29:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 16:29:48,622 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 136 [2020-09-04 16:29:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:48,622 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 16:29:48,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:29:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 16:29:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:29:48,625 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:48,625 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] [2020-09-04 16:29:48,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:29:48,625 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2106505265, now seen corresponding path program 16 times [2020-09-04 16:29:48,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:48,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771333131] [2020-09-04 16:29:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:48,630 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:48,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-04 16:29:49,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771333131] [2020-09-04 16:29:49,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:49,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:29:49,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116335717] [2020-09-04 16:29:49,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:29:49,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:49,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:29:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:29:49,694 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2020-09-04 16:29:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:50,053 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-09-04 16:29:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:29:50,056 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 144 [2020-09-04 16:29:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:50,061 INFO L225 Difference]: With dead ends: 109 [2020-09-04 16:29:50,061 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 16:29:50,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 16:29:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 16:29:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-09-04 16:29:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 16:29:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2020-09-04 16:29:50,082 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 144 [2020-09-04 16:29:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:50,083 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2020-09-04 16:29:50,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:29:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2020-09-04 16:29:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-09-04 16:29:50,088 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:50,088 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] [2020-09-04 16:29:50,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:29:50,089 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1225615079, now seen corresponding path program 17 times [2020-09-04 16:29:50,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:50,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782922510] [2020-09-04 16:29:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:50,095 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:50,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-04 16:29:51,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782922510] [2020-09-04 16:29:51,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:51,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:29:51,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301842997] [2020-09-04 16:29:51,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:29:51,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:51,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:29:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:29:51,306 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 22 states. [2020-09-04 16:29:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:51,630 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-09-04 16:29:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:29:51,631 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 152 [2020-09-04 16:29:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:51,633 INFO L225 Difference]: With dead ends: 114 [2020-09-04 16:29:51,633 INFO L226 Difference]: Without dead ends: 108 [2020-09-04 16:29:51,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 16:29:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-04 16:29:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-09-04 16:29:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 16:29:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2020-09-04 16:29:51,644 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 152 [2020-09-04 16:29:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:51,644 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2020-09-04 16:29:51,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:29:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2020-09-04 16:29:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-09-04 16:29:51,647 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:51,647 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] [2020-09-04 16:29:51,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:29:51,647 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2080643855, now seen corresponding path program 18 times [2020-09-04 16:29:51,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:51,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744023364] [2020-09-04 16:29:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:51,650 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:51,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-04 16:29:52,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744023364] [2020-09-04 16:29:52,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:52,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:29:52,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267097283] [2020-09-04 16:29:52,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:29:52,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:52,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:29:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:29:52,874 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 23 states. [2020-09-04 16:29:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:53,202 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-09-04 16:29:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:29:53,205 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 160 [2020-09-04 16:29:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:53,207 INFO L225 Difference]: With dead ends: 119 [2020-09-04 16:29:53,207 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 16:29:53,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:29:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 16:29:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-09-04 16:29:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-04 16:29:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2020-09-04 16:29:53,221 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 160 [2020-09-04 16:29:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:53,222 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2020-09-04 16:29:53,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:29:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2020-09-04 16:29:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-09-04 16:29:53,224 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:53,225 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] [2020-09-04 16:29:53,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:29:53,225 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:53,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1136658471, now seen corresponding path program 19 times [2020-09-04 16:29:53,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:53,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1304407803] [2020-09-04 16:29:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:53,231 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:53,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-04 16:29:54,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1304407803] [2020-09-04 16:29:54,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:54,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:29:54,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184074510] [2020-09-04 16:29:54,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:29:54,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:29:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:29:54,556 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 24 states. [2020-09-04 16:29:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:54,918 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-09-04 16:29:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:29:54,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 168 [2020-09-04 16:29:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:54,921 INFO L225 Difference]: With dead ends: 124 [2020-09-04 16:29:54,921 INFO L226 Difference]: Without dead ends: 118 [2020-09-04 16:29:54,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 16:29:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-04 16:29:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-09-04 16:29:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-09-04 16:29:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2020-09-04 16:29:54,940 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 168 [2020-09-04 16:29:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:54,941 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2020-09-04 16:29:54,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:29:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2020-09-04 16:29:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 16:29:54,944 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:54,945 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] [2020-09-04 16:29:54,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:29:54,945 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:54,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1108876879, now seen corresponding path program 20 times [2020-09-04 16:29:54,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:54,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566192901] [2020-09-04 16:29:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:54,948 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:29:54,993 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:29:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:29:55,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:29:55,080 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 16:29:55,081 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 16:29:55,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:29:55,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:29:55 BoogieIcfgContainer [2020-09-04 16:29:55,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:29:55,121 INFO L168 Benchmark]: Toolchain (without parser) took 18611.73 ms. Allocated memory was 141.0 MB in the beginning and 523.8 MB in the end (delta: 382.7 MB). Free memory was 104.5 MB in the beginning and 490.0 MB in the end (delta: -385.5 MB). Peak memory consumption was 394.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:55,122 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 16:29:55,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.08 ms. Allocated memory is still 141.0 MB. Free memory was 104.3 MB in the beginning and 95.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:55,123 INFO L168 Benchmark]: Boogie Preprocessor took 32.67 ms. Allocated memory is still 141.0 MB. Free memory was 95.1 MB in the beginning and 93.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:55,124 INFO L168 Benchmark]: RCFGBuilder took 421.14 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 93.8 MB in the beginning and 171.9 MB in the end (delta: -78.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:55,125 INFO L168 Benchmark]: TraceAbstraction took 17834.83 ms. Allocated memory was 203.4 MB in the beginning and 523.8 MB in the end (delta: 320.3 MB). Free memory was 171.2 MB in the beginning and 490.0 MB in the end (delta: -318.8 MB). Peak memory consumption was 398.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:55,127 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.08 ms. Allocated memory is still 141.0 MB. Free memory was 104.3 MB in the beginning and 95.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.67 ms. Allocated memory is still 141.0 MB. Free memory was 95.1 MB in the beginning and 93.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 421.14 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 93.8 MB in the beginning and 171.9 MB in the end (delta: -78.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17834.83 ms. Allocated memory was 203.4 MB in the beginning and 523.8 MB in the end (delta: 320.3 MB). Free memory was 171.2 MB in the beginning and 490.0 MB in the end (delta: -318.8 MB). Peak memory consumption was 398.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 20; [L11] CALL, EXPR id(input) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND TRUE x==0 [L5] return 0; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.7s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 364 SDtfs, 1058 SDslu, 1800 SDs, 0 SdLazy, 695 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred 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.3s 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...