/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_o10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:56:09,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:56:09,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:56:09,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:56:09,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:56:09,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:56:09,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:56:09,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:56:09,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:56:09,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:56:09,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:56:09,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:56:09,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:56:09,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:56:09,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:56:09,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:56:09,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:56:09,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:56:09,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:56:09,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:56:09,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:56:09,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:56:09,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:56:09,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:56:09,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:56:09,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:56:09,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:56:09,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:56:09,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:56:09,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:56:09,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:56:09,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:56:09,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:56:09,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:56:09,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:56:09,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:56:09,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:56:09,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:56:09,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:56:09,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:56:09,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:56:09,556 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 21:56:09,567 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:56:09,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:56:09,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:56:09,569 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:56:09,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:56:09,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:56:09,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:56:09,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:56:09,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:56:09,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:56:09,570 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:56:09,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:56:09,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:56:09,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:56:09,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:56:09,571 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:56:09,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:56:09,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:56:09,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:56:09,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:56:09,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:56:09,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:56:09,573 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:56:10,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:56:10,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:56:10,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:56:10,052 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:56:10,053 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:56:10,054 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o10.c [2020-09-04 21:56:10,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6fd51b002/b0d9e65d31a44c489ab3f207d9700713/FLAG2bb720718 [2020-09-04 21:56:10,743 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:56:10,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_o10.c [2020-09-04 21:56:10,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6fd51b002/b0d9e65d31a44c489ab3f207d9700713/FLAG2bb720718 [2020-09-04 21:56:11,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6fd51b002/b0d9e65d31a44c489ab3f207d9700713 [2020-09-04 21:56:11,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:56:11,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:56:11,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:56:11,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:56:11,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:56:11,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36801391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11, skipping insertion in model container [2020-09-04 21:56:11,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:56:11,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:56:11,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:56:11,351 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:56:11,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:56:11,390 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:56:11,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11 WrapperNode [2020-09-04 21:56:11,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:56:11,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:56:11,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:56:11,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:56:11,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (1/1) ... [2020-09-04 21:56:11,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:56:11,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:56:11,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:56:11,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:56:11,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (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 21:56:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:56:11,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:56:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:56:11,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:56:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 21:56:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:56:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:56:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:56:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:56:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:56:11,774 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:56:11,774 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:56:11,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:56:11 BoogieIcfgContainer [2020-09-04 21:56:11,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:56:11,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:56:11,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:56:11,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:56:11,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:56:11" (1/3) ... [2020-09-04 21:56:11,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dfee28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:56:11, skipping insertion in model container [2020-09-04 21:56:11,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:11" (2/3) ... [2020-09-04 21:56:11,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dfee28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:56:11, skipping insertion in model container [2020-09-04 21:56:11,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:56:11" (3/3) ... [2020-09-04 21:56:11,790 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o10.c [2020-09-04 21:56:11,801 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:56:11,811 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:56:11,832 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:56:11,862 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:56:11,863 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:56:11,863 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:56:11,863 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:56:11,863 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:56:11,864 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:56:11,864 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:56:11,864 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:56:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-04 21:56:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:56:11,891 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:11,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:11,893 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1651991454, now seen corresponding path program 1 times [2020-09-04 21:56:11,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:11,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544547658] [2020-09-04 21:56:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,325 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 21:56:12,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544547658] [2020-09-04 21:56:12,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:56:12,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:56:12,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616374497] [2020-09-04 21:56:12,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:56:12,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:12,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:56:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:56:12,359 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-09-04 21:56:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:12,447 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 21:56:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:56:12,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:56:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:12,463 INFO L225 Difference]: With dead ends: 37 [2020-09-04 21:56:12,464 INFO L226 Difference]: Without dead ends: 22 [2020-09-04 21:56:12,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:56:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-09-04 21:56:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-09-04 21:56:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-09-04 21:56:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-09-04 21:56:12,530 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2020-09-04 21:56:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:12,530 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-09-04 21:56:12,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:56:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-09-04 21:56:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 21:56:12,533 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:12,534 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] [2020-09-04 21:56:12,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:56:12,534 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash 189324707, now seen corresponding path program 1 times [2020-09-04 21:56:12,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:12,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1407089780] [2020-09-04 21:56:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:56:12,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1407089780] [2020-09-04 21:56:12,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:12,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:56:12,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956516945] [2020-09-04 21:56:12,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:56:12,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:56:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:56:12,814 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2020-09-04 21:56:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:12,896 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-04 21:56:12,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:56:12,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-04 21:56:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:12,899 INFO L225 Difference]: With dead ends: 31 [2020-09-04 21:56:12,899 INFO L226 Difference]: Without dead ends: 26 [2020-09-04 21:56:12,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:56:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-09-04 21:56:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-09-04 21:56:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-09-04 21:56:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-09-04 21:56:12,911 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2020-09-04 21:56:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:12,911 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-09-04 21:56:12,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:56:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-09-04 21:56:12,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 21:56:12,913 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:12,913 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:12,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:56:12,914 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:12,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1416732684, now seen corresponding path program 2 times [2020-09-04 21:56:12,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:12,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902950246] [2020-09-04 21:56:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 21:56:13,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902950246] [2020-09-04 21:56:13,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:13,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:56:13,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949009111] [2020-09-04 21:56:13,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:56:13,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:56:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:56:13,166 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2020-09-04 21:56:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:13,293 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-09-04 21:56:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:56:13,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-09-04 21:56:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:13,296 INFO L225 Difference]: With dead ends: 35 [2020-09-04 21:56:13,296 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:56:13,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:56:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:56:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:56:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:56:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 21:56:13,306 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 30 [2020-09-04 21:56:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:13,307 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 21:56:13,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:56:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 21:56:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 21:56:13,309 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:13,309 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:13,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:56:13,310 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash -209476043, now seen corresponding path program 3 times [2020-09-04 21:56:13,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:13,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806424447] [2020-09-04 21:56:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 21:56:13,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806424447] [2020-09-04 21:56:13,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:13,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:56:13,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636110189] [2020-09-04 21:56:13,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:56:13,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:13,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:56:13,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:56:13,649 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2020-09-04 21:56:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:13,800 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 21:56:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:56:13,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-09-04 21:56:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:13,802 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:56:13,802 INFO L226 Difference]: Without dead ends: 34 [2020-09-04 21:56:13,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:56:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-09-04 21:56:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-09-04 21:56:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 21:56:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-09-04 21:56:13,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 37 [2020-09-04 21:56:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:13,813 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-09-04 21:56:13,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:56:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-09-04 21:56:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 21:56:13,815 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:13,815 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:13,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:56:13,816 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1007399302, now seen corresponding path program 4 times [2020-09-04 21:56:13,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:13,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852201054] [2020-09-04 21:56:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:13,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:56:14,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [852201054] [2020-09-04 21:56:14,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:14,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:56:14,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110312602] [2020-09-04 21:56:14,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:56:14,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:56:14,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:56:14,151 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 13 states. [2020-09-04 21:56:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:14,335 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-04 21:56:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:56:14,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2020-09-04 21:56:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:14,337 INFO L225 Difference]: With dead ends: 43 [2020-09-04 21:56:14,338 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 21:56:14,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:56:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 21:56:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 21:56:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 21:56:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 21:56:14,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 44 [2020-09-04 21:56:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:14,349 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 21:56:14,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:56:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 21:56:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:56:14,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:14,352 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:14,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:56:14,352 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1787659065, now seen corresponding path program 5 times [2020-09-04 21:56:14,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:14,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1285098003] [2020-09-04 21:56:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 21:56:14,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1285098003] [2020-09-04 21:56:14,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:14,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:56:14,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62388008] [2020-09-04 21:56:14,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:56:14,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:56:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:56:14,777 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 15 states. [2020-09-04 21:56:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:15,024 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-09-04 21:56:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:56:15,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2020-09-04 21:56:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:15,027 INFO L225 Difference]: With dead ends: 47 [2020-09-04 21:56:15,028 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 21:56:15,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:56:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 21:56:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 21:56:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:56:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-04 21:56:15,047 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 51 [2020-09-04 21:56:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:15,047 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-04 21:56:15,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:56:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-04 21:56:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 21:56:15,051 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:15,051 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:15,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:56:15,052 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:15,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1360883432, now seen corresponding path program 6 times [2020-09-04 21:56:15,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:15,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768610098] [2020-09-04 21:56:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 21:56:15,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768610098] [2020-09-04 21:56:15,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:15,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:56:15,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594987598] [2020-09-04 21:56:15,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:56:15,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:56:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:56:15,515 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 17 states. [2020-09-04 21:56:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:15,795 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 21:56:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:56:15,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2020-09-04 21:56:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:15,797 INFO L225 Difference]: With dead ends: 51 [2020-09-04 21:56:15,797 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 21:56:15,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:56:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 21:56:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-09-04 21:56:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 21:56:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2020-09-04 21:56:15,806 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 58 [2020-09-04 21:56:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:15,807 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2020-09-04 21:56:15,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:56:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-09-04 21:56:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 21:56:15,808 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:15,808 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:15,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:56:15,809 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash -807968423, now seen corresponding path program 7 times [2020-09-04 21:56:15,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:15,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923637931] [2020-09-04 21:56:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:15,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 21:56:16,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923637931] [2020-09-04 21:56:16,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:16,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:56:16,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922063907] [2020-09-04 21:56:16,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:56:16,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:16,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:56:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:56:16,424 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 19 states. [2020-09-04 21:56:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:16,757 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-09-04 21:56:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:56:16,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2020-09-04 21:56:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:16,759 INFO L225 Difference]: With dead ends: 55 [2020-09-04 21:56:16,760 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:56:16,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:56:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:56:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 21:56:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 21:56:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 21:56:16,769 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 65 [2020-09-04 21:56:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:16,770 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 21:56:16,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:56:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 21:56:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:56:16,771 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:16,771 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:16,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:56:16,772 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash -705364310, now seen corresponding path program 8 times [2020-09-04 21:56:16,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:16,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253814874] [2020-09-04 21:56:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:16,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 21:56:17,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253814874] [2020-09-04 21:56:17,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:17,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:56:17,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085009982] [2020-09-04 21:56:17,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:56:17,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:56:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:56:17,378 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2020-09-04 21:56:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:17,808 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 21:56:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 21:56:17,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2020-09-04 21:56:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:17,813 INFO L225 Difference]: With dead ends: 59 [2020-09-04 21:56:17,813 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 21:56:17,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2020-09-04 21:56:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 21:56:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-04 21:56:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 21:56:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-09-04 21:56:17,829 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 72 [2020-09-04 21:56:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:17,829 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-09-04 21:56:17,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:56:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-09-04 21:56:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 21:56:17,833 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:17,834 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:17,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:56:17,834 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1418439701, now seen corresponding path program 9 times [2020-09-04 21:56:17,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:17,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990534079] [2020-09-04 21:56:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:17,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 21:56:18,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990534079] [2020-09-04 21:56:18,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:18,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:56:18,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414114409] [2020-09-04 21:56:18,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:56:18,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:56:18,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:56:18,575 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 23 states. [2020-09-04 21:56:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:19,110 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2020-09-04 21:56:19,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-04 21:56:19,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2020-09-04 21:56:19,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:19,112 INFO L225 Difference]: With dead ends: 63 [2020-09-04 21:56:19,112 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 21:56:19,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 21:56:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 21:56:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 21:56:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 21:56:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 21:56:19,122 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 79 [2020-09-04 21:56:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:19,123 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 21:56:19,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:56:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 21:56:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 21:56:19,124 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:19,124 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:19,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:56:19,125 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash -182126020, now seen corresponding path program 10 times [2020-09-04 21:56:19,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:19,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1729346888] [2020-09-04 21:56:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:56:19,164 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:56:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:56:19,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:56:19,270 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:56:19,271 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:56:19,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:56:19,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:56:19 BoogieIcfgContainer [2020-09-04 21:56:19,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:56:19,346 INFO L168 Benchmark]: Toolchain (without parser) took 8246.14 ms. Allocated memory was 138.4 MB in the beginning and 315.1 MB in the end (delta: 176.7 MB). Free memory was 102.3 MB in the beginning and 142.5 MB in the end (delta: -40.1 MB). Peak memory consumption was 136.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:19,348 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-04 21:56:19,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.11 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 92.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:19,353 INFO L168 Benchmark]: Boogie Preprocessor took 35.54 ms. Allocated memory is still 138.4 MB. Free memory was 92.9 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:19,354 INFO L168 Benchmark]: RCFGBuilder took 352.30 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 91.5 MB in the beginning and 169.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:19,355 INFO L168 Benchmark]: TraceAbstraction took 7561.11 ms. Allocated memory was 201.3 MB in the beginning and 315.1 MB in the end (delta: 113.8 MB). Free memory was 169.0 MB in the beginning and 142.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 140.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:56:19,369 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.11 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 92.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.54 ms. Allocated memory is still 138.4 MB. Free memory was 92.9 MB in the beginning and 91.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 352.30 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 91.5 MB in the beginning and 169.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7561.11 ms. Allocated memory was 201.3 MB in the beginning and 315.1 MB in the end (delta: 113.8 MB). Free memory was 169.0 MB in the beginning and 142.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 140.3 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] unsigned int input = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=10, input=10] [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 VAL [\old(x)=0, x=0] [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); VAL [id(input)=10, input=10, result=10] [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 320 SDtfs, 57 SDslu, 3501 SDs, 0 SdLazy, 1432 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 561 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 107415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/1020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...