/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/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 22:09:43,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:09:43,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:09:44,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:09:44,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:09:44,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:09:44,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:09:44,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:09:44,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:09:44,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:09:44,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:09:44,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:09:44,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:09:44,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:09:44,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:09:44,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:09:44,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:09:44,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:09:44,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:09:44,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:09:44,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:09:44,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:09:44,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:09:44,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:09:44,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:09:44,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:09:44,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:09:44,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:09:44,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:09:44,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:09:44,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:09:44,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:09:44,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:09:44,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:09:44,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:09:44,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:09:44,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:09:44,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:09:44,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:09:44,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:09:44,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:09:44,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 22:09:44,064 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:09:44,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:09:44,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:09:44,066 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:09:44,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:09:44,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:09:44,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:09:44,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:09:44,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:09:44,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:09:44,067 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:09:44,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:09:44,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:09:44,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:09:44,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:09:44,068 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:09:44,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:09:44,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:09:44,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:09:44,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:09:44,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:09:44,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:09:44,070 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-08-22 22:09:44,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:09:44,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:09:44,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:09:44,401 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:09:44,401 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:09:44,402 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-08-22 22:09:44,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164b2a3ee/717e06183a2a43469faa15ea132afa30/FLAG24a80ccdc [2020-08-22 22:09:44,929 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:09:44,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-08-22 22:09:44,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164b2a3ee/717e06183a2a43469faa15ea132afa30/FLAG24a80ccdc [2020-08-22 22:09:45,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164b2a3ee/717e06183a2a43469faa15ea132afa30 [2020-08-22 22:09:45,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:09:45,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:09:45,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:09:45,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:09:45,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:09:45,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10628d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45, skipping insertion in model container [2020-08-22 22:09:45,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:09:45,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:09:45,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:09:45,569 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:09:45,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:09:45,599 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:09:45,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45 WrapperNode [2020-08-22 22:09:45,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:09:45,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:09:45,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:09:45,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:09:45,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... [2020-08-22 22:09:45,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:09:45,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:09:45,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:09:45,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:09:45,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:09:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:09:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:09:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-22 22:09:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:09:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:09:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:09:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-22 22:09:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:09:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:09:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:09:45,966 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:09:45,967 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 22:09:45,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:09:45 BoogieIcfgContainer [2020-08-22 22:09:45,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:09:45,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:09:45,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:09:45,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:09:45,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:09:45" (1/3) ... [2020-08-22 22:09:45,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d4bd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:09:45, skipping insertion in model container [2020-08-22 22:09:45,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:09:45" (2/3) ... [2020-08-22 22:09:45,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d4bd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:09:45, skipping insertion in model container [2020-08-22 22:09:45,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:09:45" (3/3) ... [2020-08-22 22:09:45,981 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-08-22 22:09:45,993 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:09:46,002 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:09:46,020 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:09:46,049 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:09:46,050 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:09:46,050 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:09:46,050 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:09:46,050 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:09:46,050 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:09:46,051 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:09:46,051 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:09:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-08-22 22:09:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 22:09:46,082 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:46,083 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:46,084 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-08-22 22:09:46,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:46,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [882593221] [2020-08-22 22:09:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:09:46,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [882593221] [2020-08-22 22:09:46,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:09:46,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:09:46,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366983527] [2020-08-22 22:09:46,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:09:46,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:09:46,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:09:46,391 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-08-22 22:09:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:46,492 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-08-22 22:09:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:09:46,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 22:09:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:46,506 INFO L225 Difference]: With dead ends: 44 [2020-08-22 22:09:46,507 INFO L226 Difference]: Without dead ends: 28 [2020-08-22 22:09:46,511 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-08-22 22:09:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-08-22 22:09:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-08-22 22:09:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-08-22 22:09:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-08-22 22:09:46,558 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-08-22 22:09:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:46,559 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-08-22 22:09:46,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:09:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-08-22 22:09:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-08-22 22:09:46,561 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:46,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:46,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:09:46,562 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:46,563 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-08-22 22:09:46,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:46,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [892523080] [2020-08-22 22:09:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:09:46,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [892523080] [2020-08-22 22:09:46,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:09:46,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:09:46,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256085225] [2020-08-22 22:09:46,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:09:46,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:46,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:09:46,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:09:46,645 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-08-22 22:09:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:46,711 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-08-22 22:09:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:09:46,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-08-22 22:09:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:46,713 INFO L225 Difference]: With dead ends: 36 [2020-08-22 22:09:46,714 INFO L226 Difference]: Without dead ends: 30 [2020-08-22 22:09:46,715 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-08-22 22:09:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-22 22:09:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-08-22 22:09:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-08-22 22:09:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-08-22 22:09:46,727 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-08-22 22:09:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:46,728 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-08-22 22:09:46,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:09:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-08-22 22:09:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-08-22 22:09:46,730 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:46,730 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:46,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:09:46,730 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-08-22 22:09:46,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:46,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [278952796] [2020-08-22 22:09:46,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:09:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 22:09:46,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [278952796] [2020-08-22 22:09:46,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:09:46,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:09:46,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440196150] [2020-08-22 22:09:46,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:09:46,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:46,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:09:46,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:09:46,883 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-08-22 22:09:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:46,988 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-08-22 22:09:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 22:09:46,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-08-22 22:09:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:46,991 INFO L225 Difference]: With dead ends: 52 [2020-08-22 22:09:46,991 INFO L226 Difference]: Without dead ends: 30 [2020-08-22 22:09:46,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:09:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-22 22:09:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-22 22:09:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 22:09:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-08-22 22:09:47,005 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-08-22 22:09:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:47,006 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-08-22 22:09:47,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:09:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-08-22 22:09:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 22:09:47,008 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:47,008 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:47,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:09:47,009 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-08-22 22:09:47,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:47,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568198328] [2020-08-22 22:09:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 22:09:47,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568198328] [2020-08-22 22:09:47,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:09:47,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 22:09:47,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940533717] [2020-08-22 22:09:47,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 22:09:47,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 22:09:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 22:09:47,120 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-08-22 22:09:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:47,256 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-08-22 22:09:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 22:09:47,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-08-22 22:09:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:47,259 INFO L225 Difference]: With dead ends: 56 [2020-08-22 22:09:47,259 INFO L226 Difference]: Without dead ends: 50 [2020-08-22 22:09:47,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-08-22 22:09:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-08-22 22:09:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-08-22 22:09:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-08-22 22:09:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-08-22 22:09:47,277 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-08-22 22:09:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:47,277 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-08-22 22:09:47,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 22:09:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-08-22 22:09:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 22:09:47,280 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:47,280 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:47,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:09:47,281 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-08-22 22:09:47,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:47,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263547446] [2020-08-22 22:09:47,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 22:09:47,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263547446] [2020-08-22 22:09:47,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:09:47,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:09:47,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638720569] [2020-08-22 22:09:47,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:09:47,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:09:47,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:09:47,521 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-08-22 22:09:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:47,671 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-08-22 22:09:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:09:47,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-22 22:09:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:47,675 INFO L225 Difference]: With dead ends: 111 [2020-08-22 22:09:47,675 INFO L226 Difference]: Without dead ends: 67 [2020-08-22 22:09:47,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-22 22:09:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-08-22 22:09:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-08-22 22:09:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-22 22:09:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-08-22 22:09:47,692 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-08-22 22:09:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:47,693 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-08-22 22:09:47,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:09:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-08-22 22:09:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 22:09:47,695 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:47,696 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:47,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:09:47,696 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:47,697 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-08-22 22:09:47,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:47,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1486286754] [2020-08-22 22:09:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 22:09:47,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1486286754] [2020-08-22 22:09:47,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:09:47,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 22:09:47,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287357523] [2020-08-22 22:09:47,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:09:47,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:09:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:09:47,808 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-08-22 22:09:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:47,915 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-08-22 22:09:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 22:09:47,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-08-22 22:09:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:47,918 INFO L225 Difference]: With dead ends: 89 [2020-08-22 22:09:47,918 INFO L226 Difference]: Without dead ends: 83 [2020-08-22 22:09:47,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:09:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-08-22 22:09:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-08-22 22:09:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-08-22 22:09:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-08-22 22:09:47,937 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-08-22 22:09:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:47,937 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-08-22 22:09:47,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:09:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-08-22 22:09:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 22:09:47,943 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:47,943 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:47,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:09:47,943 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:47,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:47,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-08-22 22:09:47,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:47,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1767136528] [2020-08-22 22:09:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:47,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:09:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:09:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-08-22 22:09:48,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1767136528] [2020-08-22 22:09:48,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:09:48,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 22:09:48,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063673116] [2020-08-22 22:09:48,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 22:09:48,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:48,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 22:09:48,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 22:09:48,276 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-08-22 22:09:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:48,609 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-08-22 22:09:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 22:09:48,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-08-22 22:09:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:48,613 INFO L225 Difference]: With dead ends: 142 [2020-08-22 22:09:48,613 INFO L226 Difference]: Without dead ends: 73 [2020-08-22 22:09:48,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-08-22 22:09:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-08-22 22:09:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-08-22 22:09:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 22:09:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-08-22 22:09:48,631 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-08-22 22:09:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:48,631 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-08-22 22:09:48,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 22:09:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-08-22 22:09:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-08-22 22:09:48,634 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:48,634 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:48,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:09:48,635 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:48,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-08-22 22:09:48,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:48,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346081823] [2020-08-22 22:09:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:09:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:09:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:48,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:09:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:09:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-08-22 22:09:49,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346081823] [2020-08-22 22:09:49,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:09:49,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 22:09:49,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205560978] [2020-08-22 22:09:49,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 22:09:49,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 22:09:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-08-22 22:09:49,207 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-08-22 22:09:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:49,667 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-08-22 22:09:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 22:09:49,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-08-22 22:09:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:49,671 INFO L225 Difference]: With dead ends: 149 [2020-08-22 22:09:49,671 INFO L226 Difference]: Without dead ends: 92 [2020-08-22 22:09:49,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2020-08-22 22:09:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-08-22 22:09:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-08-22 22:09:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-08-22 22:09:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-08-22 22:09:49,689 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 193 [2020-08-22 22:09:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:49,690 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-08-22 22:09:49,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 22:09:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-08-22 22:09:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-08-22 22:09:49,693 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:49,694 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:49,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:09:49,694 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:49,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 6 times [2020-08-22 22:09:49,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:49,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1468247357] [2020-08-22 22:09:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:09:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:09:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:49,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:09:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:09:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 22:09:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 22:09:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 22:09:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 22:09:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 22:09:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 22:09:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:09:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 552 proven. 920 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2020-08-22 22:09:50,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1468247357] [2020-08-22 22:09:50,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:09:50,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 22:09:50,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748964808] [2020-08-22 22:09:50,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 22:09:50,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:09:50,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 22:09:50,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-08-22 22:09:50,438 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 15 states. [2020-08-22 22:09:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:09:51,027 INFO L93 Difference]: Finished difference Result 194 states and 284 transitions. [2020-08-22 22:09:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-08-22 22:09:51,028 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-08-22 22:09:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:09:51,032 INFO L225 Difference]: With dead ends: 194 [2020-08-22 22:09:51,032 INFO L226 Difference]: Without dead ends: 119 [2020-08-22 22:09:51,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2020-08-22 22:09:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-08-22 22:09:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2020-08-22 22:09:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-08-22 22:09:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2020-08-22 22:09:51,067 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 281 [2020-08-22 22:09:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:09:51,068 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2020-08-22 22:09:51,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 22:09:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2020-08-22 22:09:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-08-22 22:09:51,076 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:09:51,077 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:09:51,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:09:51,077 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:09:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:09:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-08-22 22:09:51,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:09:51,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025984523] [2020-08-22 22:09:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:09:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 22:09:51,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 22:09:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 22:09:51,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 22:09:51,338 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 22:09:51,338 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 22:09:51,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:09:51,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:09:51 BoogieIcfgContainer [2020-08-22 22:09:51,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:09:51,436 INFO L168 Benchmark]: Toolchain (without parser) took 6112.21 ms. Allocated memory was 136.3 MB in the beginning and 341.8 MB in the end (delta: 205.5 MB). Free memory was 101.0 MB in the beginning and 289.4 MB in the end (delta: -188.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2020-08-22 22:09:51,437 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 22:09:51,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.01 ms. Allocated memory is still 136.3 MB. Free memory was 100.8 MB in the beginning and 91.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-22 22:09:51,439 INFO L168 Benchmark]: Boogie Preprocessor took 25.66 ms. Allocated memory is still 136.3 MB. Free memory was 91.4 MB in the beginning and 90.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-22 22:09:51,440 INFO L168 Benchmark]: RCFGBuilder took 345.20 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 90.1 MB in the beginning and 166.0 MB in the end (delta: -76.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-08-22 22:09:51,441 INFO L168 Benchmark]: TraceAbstraction took 5460.87 ms. Allocated memory was 199.2 MB in the beginning and 341.8 MB in the end (delta: 142.6 MB). Free memory was 165.3 MB in the beginning and 289.4 MB in the end (delta: -124.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2020-08-22 22:09:51,445 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.24 ms. Allocated memory is still 136.3 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.01 ms. Allocated memory is still 136.3 MB. Free memory was 100.8 MB in the beginning and 91.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.66 ms. Allocated memory is still 136.3 MB. Free memory was 91.4 MB in the beginning and 90.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 345.20 ms. Allocated memory was 136.3 MB in the beginning and 199.2 MB in the end (delta: 62.9 MB). Free memory was 90.1 MB in the beginning and 166.0 MB in the end (delta: -76.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5460.87 ms. Allocated memory was 199.2 MB in the beginning and 341.8 MB in the end (delta: 142.6 MB). Free memory was 165.3 MB in the beginning and 289.4 MB in the end (delta: -124.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); VAL [fibo(x)=13, result=13, x=7] [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.2s, OverallIterations: 10, TraceHistogramMax: 41, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 553 SDslu, 804 SDs, 0 SdLazy, 864 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=9, 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, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 245967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 3333/4887 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...