/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 16:34:35,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 16:34:35,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 16:34:35,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 16:34:35,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 16:34:35,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 16:34:35,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 16:34:35,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 16:34:35,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 16:34:35,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 16:34:35,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 16:34:35,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 16:34:35,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 16:34:35,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 16:34:35,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 16:34:35,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 16:34:35,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 16:34:35,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 16:34:35,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 16:34:35,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 16:34:35,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 16:34:35,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 16:34:35,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 16:34:35,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 16:34:35,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 16:34:35,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 16:34:35,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 16:34:35,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 16:34:35,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 16:34:35,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 16:34:35,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 16:34:35,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 16:34:35,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 16:34:35,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 16:34:35,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 16:34:35,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 16:34:35,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 16:34:35,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 16:34:35,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 16:34:35,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 16:34:35,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 16:34:35,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 16:34:35,262 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 16:34:35,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 16:34:35,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 16:34:35,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 16:34:35,264 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 16:34:35,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 16:34:35,265 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 16:34:35,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 16:34:35,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 16:34:35,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 16:34:35,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 16:34:35,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 16:34:35,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 16:34:35,266 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 16:34:35,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 16:34:35,267 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 16:34:35,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 16:34:35,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 16:34:35,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 16:34:35,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 16:34:35,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 16:34:35,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 16:34:35,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 16:34:35,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 16:34:35,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 16:34:35,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 16:34:35,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 16:34:35,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 16:34:35,269 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 16:34:35,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 16:34:35,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 16:34:35,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 16:34:35,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 16:34:35,587 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 16:34:35,588 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 16:34:35,589 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 16:34:35,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d421301/2c96e21f9f744b9581756b1efae4b369/FLAG0733cdcbc [2020-08-22 16:34:36,168 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 16:34:36,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-08-22 16:34:36,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d421301/2c96e21f9f744b9581756b1efae4b369/FLAG0733cdcbc [2020-08-22 16:34:36,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d421301/2c96e21f9f744b9581756b1efae4b369 [2020-08-22 16:34:36,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 16:34:36,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 16:34:36,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 16:34:36,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 16:34:36,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 16:34:36,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795ef679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36, skipping insertion in model container [2020-08-22 16:34:36,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 16:34:36,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 16:34:36,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:34:36,755 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 16:34:36,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:34:36,781 INFO L208 MainTranslator]: Completed translation [2020-08-22 16:34:36,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36 WrapperNode [2020-08-22 16:34:36,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 16:34:36,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 16:34:36,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 16:34:36,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 16:34:36,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (1/1) ... [2020-08-22 16:34:36,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 16:34:36,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 16:34:36,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 16:34:36,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 16:34:36,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (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 16:34:36,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 16:34:36,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 16:34:36,968 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-22 16:34:36,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 16:34:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 16:34:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 16:34:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-22 16:34:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 16:34:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 16:34:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 16:34:37,159 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 16:34:37,160 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 16:34:37,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:34:37 BoogieIcfgContainer [2020-08-22 16:34:37,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 16:34:37,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 16:34:37,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 16:34:37,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 16:34:37,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 04:34:36" (1/3) ... [2020-08-22 16:34:37,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec49117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:34:37, skipping insertion in model container [2020-08-22 16:34:37,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:36" (2/3) ... [2020-08-22 16:34:37,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec49117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:34:37, skipping insertion in model container [2020-08-22 16:34:37,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:34:37" (3/3) ... [2020-08-22 16:34:37,191 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-08-22 16:34:37,218 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 16:34:37,236 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 16:34:37,255 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 16:34:37,281 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 16:34:37,281 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 16:34:37,281 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 16:34:37,282 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 16:34:37,282 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 16:34:37,282 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 16:34:37,282 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 16:34:37,282 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 16:34:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-22 16:34:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 16:34:37,305 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:37,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:37,306 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-22 16:34:37,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:37,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926114170] [2020-08-22 16:34:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,550 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 16:34:37,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926114170] [2020-08-22 16:34:37,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:34:37,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 16:34:37,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252990596] [2020-08-22 16:34:37,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 16:34:37,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:37,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 16:34:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 16:34:37,584 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-22 16:34:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:37,691 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 16:34:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:34:37,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 16:34:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:37,702 INFO L225 Difference]: With dead ends: 35 [2020-08-22 16:34:37,702 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 16:34:37,706 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 16:34:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 16:34:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 16:34:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 16:34:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 16:34:37,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 16:34:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:37,749 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 16:34:37,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 16:34:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 16:34:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 16:34:37,752 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:37,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:37,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 16:34:37,753 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-22 16:34:37,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:37,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007308909] [2020-08-22 16:34:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,824 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 16:34:37,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007308909] [2020-08-22 16:34:37,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:34:37,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 16:34:37,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053918980] [2020-08-22 16:34:37,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 16:34:37,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 16:34:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 16:34:37,830 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 16:34:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:37,897 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 16:34:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:34:37,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 16:34:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:37,899 INFO L225 Difference]: With dead ends: 27 [2020-08-22 16:34:37,900 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 16:34:37,901 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 16:34:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 16:34:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 16:34:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 16:34:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 16:34:37,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 16:34:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:37,910 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 16:34:37,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 16:34:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 16:34:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 16:34:37,912 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:37,912 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] [2020-08-22 16:34:37,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 16:34:37,912 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-22 16:34:37,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:37,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382400541] [2020-08-22 16:34:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:37,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 16:34:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 16:34:38,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382400541] [2020-08-22 16:34:38,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779821649] [2020-08-22 16:34:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-08-22 16:34:38,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 16:34:38,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:38,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-08-22 16:34:38,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314211215] [2020-08-22 16:34:38,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 16:34:38,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:38,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 16:34:38,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:34:38,239 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-08-22 16:34:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:38,364 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 16:34:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 16:34:38,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-08-22 16:34:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:38,366 INFO L225 Difference]: With dead ends: 38 [2020-08-22 16:34:38,367 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 16:34:38,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-08-22 16:34:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 16:34:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 16:34:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 16:34:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 16:34:38,376 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 16:34:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:38,376 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 16:34:38,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 16:34:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 16:34:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 16:34:38,378 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:38,378 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] [2020-08-22 16:34:38,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-08-22 16:34:38,594 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-22 16:34:38,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:38,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037300107] [2020-08-22 16:34:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,756 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 16:34:38,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037300107] [2020-08-22 16:34:38,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770859321] [2020-08-22 16:34:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:38,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-08-22 16:34:38,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:38,838 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 16:34:38,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:38,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-08-22 16:34:38,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400048656] [2020-08-22 16:34:38,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 16:34:38,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:38,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 16:34:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-08-22 16:34:38,841 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-08-22 16:34:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:38,978 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 16:34:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 16:34:38,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-08-22 16:34:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:38,983 INFO L225 Difference]: With dead ends: 41 [2020-08-22 16:34:38,984 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 16:34:38,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:34:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 16:34:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 16:34:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 16:34:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 16:34:39,005 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 16:34:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:39,006 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 16:34:39,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 16:34:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 16:34:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 16:34:39,010 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:39,011 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:39,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:39,225 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-22 16:34:39,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:39,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106930234] [2020-08-22 16:34:39,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:39,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:39,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:39,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:39,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:39,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:39,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 16:34:39,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106930234] [2020-08-22 16:34:39,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215348152] [2020-08-22 16:34:39,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:39,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-08-22 16:34:39,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:34:39,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 16:34:39,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 16:34:39,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:39,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-08-22 16:34:39,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473062392] [2020-08-22 16:34:39,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 16:34:39,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:39,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 16:34:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-08-22 16:34:39,502 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-08-22 16:34:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:39,798 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-08-22 16:34:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 16:34:39,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-08-22 16:34:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:39,802 INFO L225 Difference]: With dead ends: 72 [2020-08-22 16:34:39,802 INFO L226 Difference]: Without dead ends: 41 [2020-08-22 16:34:39,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-08-22 16:34:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-08-22 16:34:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-08-22 16:34:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-08-22 16:34:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-08-22 16:34:39,827 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-08-22 16:34:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:39,827 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-08-22 16:34:39,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 16:34:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-08-22 16:34:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-08-22 16:34:39,830 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:39,830 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:40,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:40,035 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2020-08-22 16:34:40,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:40,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488154557] [2020-08-22 16:34:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-08-22 16:34:40,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488154557] [2020-08-22 16:34:40,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501805734] [2020-08-22 16:34:40,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:40,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-08-22 16:34:40,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:34:40,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 16:34:40,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-08-22 16:34:40,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:40,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-08-22 16:34:40,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75158039] [2020-08-22 16:34:40,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 16:34:40,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 16:34:40,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:34:40,446 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2020-08-22 16:34:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:40,609 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2020-08-22 16:34:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 16:34:40,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2020-08-22 16:34:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:40,616 INFO L225 Difference]: With dead ends: 88 [2020-08-22 16:34:40,616 INFO L226 Difference]: Without dead ends: 53 [2020-08-22 16:34:40,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-08-22 16:34:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-08-22 16:34:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-08-22 16:34:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-08-22 16:34:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-08-22 16:34:40,642 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 68 [2020-08-22 16:34:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:40,643 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-08-22 16:34:40,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 16:34:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-08-22 16:34:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 16:34:40,652 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:40,653 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:40,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:40,854 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -19418837, now seen corresponding path program 4 times [2020-08-22 16:34:40,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:40,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775769145] [2020-08-22 16:34:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:40,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:34:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 280 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-08-22 16:34:41,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775769145] [2020-08-22 16:34:41,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072141541] [2020-08-22 16:34:41,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:41,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-08-22 16:34:41,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:34:41,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2020-08-22 16:34:41,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 280 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-08-22 16:34:41,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:41,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-08-22 16:34:41,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853988796] [2020-08-22 16:34:41,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 16:34:41,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 16:34:41,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:34:41,249 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 10 states. [2020-08-22 16:34:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:41,434 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2020-08-22 16:34:41,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 16:34:41,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-08-22 16:34:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:41,439 INFO L225 Difference]: With dead ends: 120 [2020-08-22 16:34:41,439 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 16:34:41,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-08-22 16:34:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 16:34:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2020-08-22 16:34:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-08-22 16:34:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2020-08-22 16:34:41,460 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 123 [2020-08-22 16:34:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:41,461 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2020-08-22 16:34:41,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 16:34:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2020-08-22 16:34:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-08-22 16:34:41,465 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:41,465 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:41,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-08-22 16:34:41,679 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 5 times [2020-08-22 16:34:41,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:41,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142390007] [2020-08-22 16:34:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:41,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:34:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 16:34:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:34:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-08-22 16:34:42,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142390007] [2020-08-22 16:34:42,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977650099] [2020-08-22 16:34:42,313 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:42,398 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2020-08-22 16:34:42,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:34:42,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2020-08-22 16:34:42,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2020-08-22 16:34:42,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:42,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2020-08-22 16:34:42,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57269281] [2020-08-22 16:34:42,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-22 16:34:42,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-22 16:34:42,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-08-22 16:34:42,568 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand 19 states. [2020-08-22 16:34:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:43,361 INFO L93 Difference]: Finished difference Result 196 states and 368 transitions. [2020-08-22 16:34:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-08-22 16:34:43,362 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 218 [2020-08-22 16:34:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:43,368 INFO L225 Difference]: With dead ends: 196 [2020-08-22 16:34:43,368 INFO L226 Difference]: Without dead ends: 98 [2020-08-22 16:34:43,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2020-08-22 16:34:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-08-22 16:34:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2020-08-22 16:34:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-22 16:34:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2020-08-22 16:34:43,402 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 218 [2020-08-22 16:34:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:43,403 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2020-08-22 16:34:43,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-22 16:34:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2020-08-22 16:34:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 16:34:43,413 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:43,413 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:43,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:43,614 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 6 times [2020-08-22 16:34:43,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:43,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903599351] [2020-08-22 16:34:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 16:34:43,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 16:34:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 16:34:43,725 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 16:34:43,767 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-08-22 16:34:43,768 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 16:34:43,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 16:34:43,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 04:34:43 BoogieIcfgContainer [2020-08-22 16:34:43,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 16:34:43,895 INFO L168 Benchmark]: Toolchain (without parser) took 7353.89 ms. Allocated memory was 138.9 MB in the beginning and 319.8 MB in the end (delta: 180.9 MB). Free memory was 102.5 MB in the beginning and 133.0 MB in the end (delta: -30.5 MB). Peak memory consumption was 150.4 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:43,897 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 16:34:43,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.05 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:43,910 INFO L168 Benchmark]: Boogie Preprocessor took 25.34 ms. Allocated memory is still 138.9 MB. Free memory was 92.7 MB in the beginning and 91.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:43,912 INFO L168 Benchmark]: RCFGBuilder took 356.99 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 91.3 MB in the beginning and 169.8 MB in the end (delta: -78.5 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:43,914 INFO L168 Benchmark]: TraceAbstraction took 6707.06 ms. Allocated memory was 201.9 MB in the beginning and 319.8 MB in the end (delta: 118.0 MB). Free memory was 169.1 MB in the beginning and 133.0 MB in the end (delta: 36.1 MB). Peak memory consumption was 154.0 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:43,927 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.05 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.34 ms. Allocated memory is still 138.9 MB. Free memory was 92.7 MB in the beginning and 91.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.99 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 91.3 MB in the beginning and 169.8 MB in the end (delta: -78.5 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6707.06 ms. Allocated memory was 201.9 MB in the beginning and 319.8 MB in the end (delta: 118.0 MB). Free memory was 169.1 MB in the beginning and 133.0 MB in the end (delta: 36.1 MB). Peak memory consumption was 154.0 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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [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, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.4s, OverallIterations: 9, TraceHistogramMax: 41, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 158 SDtfs, 355 SDslu, 527 SDs, 0 SdLazy, 845 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, 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, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1317 NumberOfCodeBlocks, 1233 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1017 ConstructedInterpolants, 0 QuantifiedInterpolants, 228759 SizeOfPredicates, 30 NumberOfNonLiveVariables, 924 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 5125/7176 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...