/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=LOWLEXORDER -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 18:39:18,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 18:39:18,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 18:39:18,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 18:39:18,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 18:39:18,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 18:39:18,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 18:39:18,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 18:39:18,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 18:39:18,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 18:39:18,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 18:39:18,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 18:39:18,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 18:39:18,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 18:39:18,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 18:39:18,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 18:39:18,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 18:39:18,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 18:39:18,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 18:39:18,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 18:39:18,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 18:39:18,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 18:39:18,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 18:39:18,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 18:39:18,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 18:39:18,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 18:39:18,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 18:39:18,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 18:39:18,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 18:39:18,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 18:39:18,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 18:39:18,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 18:39:18,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 18:39:18,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 18:39:18,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 18:39:18,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 18:39:18,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 18:39:18,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 18:39:18,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 18:39:18,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 18:39:18,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 18:39:18,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-18 18:39:18,511 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 18:39:18,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 18:39:18,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 18:39:18,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 18:39:18,514 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 18:39:18,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 18:39:18,514 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 18:39:18,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 18:39:18,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 18:39:18,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 18:39:18,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 18:39:18,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 18:39:18,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 18:39:18,517 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 18:39:18,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 18:39:18,517 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 18:39:18,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 18:39:18,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 18:39:18,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 18:39:18,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 18:39:18,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 18:39:18,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 18:39:18,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 18:39:18,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 18:39:18,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 18:39:18,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 18:39:18,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 18:39:18,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 18:39:18,519 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 18:39:18,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=LOWLEXORDER; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=LOWLEXORDER; [2020-08-18 18:39:18,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 18:39:18,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 18:39:18,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 18:39:18,895 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 18:39:18,895 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 18:39:18,896 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 18:39:18,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fe3037541/fe5c1073d34447a58ae4a1281562b3fb/FLAG465c9668a [2020-08-18 18:39:19,449 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 18:39:19,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 18:39:19,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fe3037541/fe5c1073d34447a58ae4a1281562b3fb/FLAG465c9668a [2020-08-18 18:39:19,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fe3037541/fe5c1073d34447a58ae4a1281562b3fb [2020-08-18 18:39:19,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 18:39:19,847 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 18:39:19,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 18:39:19,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 18:39:19,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 18:39:19,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 06:39:19" (1/1) ... [2020-08-18 18:39:19,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@538d8bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:19, skipping insertion in model container [2020-08-18 18:39:19,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 06:39:19" (1/1) ... [2020-08-18 18:39:19,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 18:39:19,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 18:39:20,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 18:39:20,039 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 18:39:20,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 18:39:20,064 INFO L208 MainTranslator]: Completed translation [2020-08-18 18:39:20,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20 WrapperNode [2020-08-18 18:39:20,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 18:39:20,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 18:39:20,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 18:39:20,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 18:39:20,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... [2020-08-18 18:39:20,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... [2020-08-18 18:39:20,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... [2020-08-18 18:39:20,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... [2020-08-18 18:39:20,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... [2020-08-18 18:39:20,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... [2020-08-18 18:39:20,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... [2020-08-18 18:39:20,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 18:39:20,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 18:39:20,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 18:39:20,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 18:39:20,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 18:39:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 18:39:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 18:39:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 18:39:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 18:39:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 18:39:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 18:39:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 18:39:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 18:39:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 18:39:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 18:39:20,433 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 18:39:20,434 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 18:39:20,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 06:39:20 BoogieIcfgContainer [2020-08-18 18:39:20,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 18:39:20,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 18:39:20,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 18:39:20,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 18:39:20,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 06:39:19" (1/3) ... [2020-08-18 18:39:20,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c1fb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 06:39:20, skipping insertion in model container [2020-08-18 18:39:20,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:20" (2/3) ... [2020-08-18 18:39:20,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c1fb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 06:39:20, skipping insertion in model container [2020-08-18 18:39:20,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 06:39:20" (3/3) ... [2020-08-18 18:39:20,447 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 18:39:20,460 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 18:39:20,469 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 18:39:20,492 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 18:39:20,527 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 18:39:20,527 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 18:39:20,527 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 18:39:20,528 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 18:39:20,528 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 18:39:20,528 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 18:39:20,528 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 18:39:20,529 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 18:39:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 18:39:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 18:39:20,561 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:20,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:20,563 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 18:39:20,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:20,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1527323694] [2020-08-18 18:39:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:20,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:20,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:20,837 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-18 18:39:20,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1527323694] [2020-08-18 18:39:20,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 18:39:20,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 18:39:20,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79255050] [2020-08-18 18:39:20,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 18:39:20,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 18:39:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 18:39:20,861 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 18:39:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:20,994 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 18:39:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 18:39:20,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 18:39:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:21,006 INFO L225 Difference]: With dead ends: 35 [2020-08-18 18:39:21,009 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 18:39:21,013 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-18 18:39:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 18:39:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 18:39:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 18:39:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 18:39:21,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 18:39:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:21,059 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 18:39:21,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 18:39:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 18:39:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 18:39:21,061 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:21,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:21,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 18:39:21,062 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 18:39:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:21,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568125426] [2020-08-18 18:39:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,143 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-18 18:39:21,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568125426] [2020-08-18 18:39:21,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 18:39:21,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 18:39:21,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010269985] [2020-08-18 18:39:21,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 18:39:21,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 18:39:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 18:39:21,147 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 18:39:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:21,219 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 18:39:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 18:39:21,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 18:39:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:21,222 INFO L225 Difference]: With dead ends: 27 [2020-08-18 18:39:21,222 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 18:39:21,223 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-18 18:39:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 18:39:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 18:39:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 18:39:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 18:39:21,233 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 18:39:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:21,233 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 18:39:21,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 18:39:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 18:39:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 18:39:21,235 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:21,235 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-18 18:39:21,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 18:39:21,236 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 18:39:21,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:21,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [241471560] [2020-08-18 18:39:21,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 18:39:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,385 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-18 18:39:21,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [241471560] [2020-08-18 18:39:21,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:21,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 18:39:21,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345888000] [2020-08-18 18:39:21,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 18:39:21,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 18:39:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 18:39:21,388 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 18:39:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:21,479 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 18:39:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 18:39:21,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 18:39:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:21,481 INFO L225 Difference]: With dead ends: 38 [2020-08-18 18:39:21,481 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 18:39:21,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-18 18:39:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 18:39:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 18:39:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 18:39:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 18:39:21,491 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 18:39:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:21,491 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 18:39:21,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 18:39:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 18:39:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 18:39:21,493 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:21,494 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-18 18:39:21,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 18:39:21,494 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 18:39:21,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:21,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992460228] [2020-08-18 18:39:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,665 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-18 18:39:21,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992460228] [2020-08-18 18:39:21,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:21,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 18:39:21,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046826292] [2020-08-18 18:39:21,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 18:39:21,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 18:39:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 18:39:21,671 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 18:39:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:21,806 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 18:39:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 18:39:21,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 18:39:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:21,810 INFO L225 Difference]: With dead ends: 41 [2020-08-18 18:39:21,810 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 18:39:21,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-18 18:39:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 18:39:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 18:39:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 18:39:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 18:39:21,823 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 18:39:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:21,824 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 18:39:21,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 18:39:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 18:39:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 18:39:21,826 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:21,826 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-18 18:39:21,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 18:39:21,827 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 18:39:21,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:21,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980802209] [2020-08-18 18:39:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:21,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,003 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-18 18:39:22,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980802209] [2020-08-18 18:39:22,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:22,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 18:39:22,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135720179] [2020-08-18 18:39:22,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 18:39:22,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:22,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 18:39:22,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 18:39:22,006 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 18:39:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:22,125 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 18:39:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 18:39:22,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 18:39:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:22,128 INFO L225 Difference]: With dead ends: 76 [2020-08-18 18:39:22,128 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 18:39:22,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-18 18:39:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 18:39:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 18:39:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 18:39:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 18:39:22,143 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 18:39:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:22,143 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 18:39:22,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 18:39:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 18:39:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 18:39:22,145 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:22,146 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:22,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 18:39:22,146 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:22,147 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 18:39:22,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:22,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721800997] [2020-08-18 18:39:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-18 18:39:22,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721800997] [2020-08-18 18:39:22,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:22,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 18:39:22,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188356104] [2020-08-18 18:39:22,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 18:39:22,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:22,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 18:39:22,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 18:39:22,321 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 18:39:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:22,428 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 18:39:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 18:39:22,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 18:39:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:22,431 INFO L225 Difference]: With dead ends: 62 [2020-08-18 18:39:22,431 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 18:39:22,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 18:39:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 18:39:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 18:39:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 18:39:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 18:39:22,446 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 18:39:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:22,447 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 18:39:22,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 18:39:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 18:39:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 18:39:22,451 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:22,451 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:22,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 18:39:22,452 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 18:39:22,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:22,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550501466] [2020-08-18 18:39:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-18 18:39:22,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550501466] [2020-08-18 18:39:22,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:22,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 18:39:22,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456899777] [2020-08-18 18:39:22,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 18:39:22,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 18:39:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 18:39:22,759 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 18:39:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:22,971 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 18:39:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 18:39:22,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 18:39:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:22,981 INFO L225 Difference]: With dead ends: 97 [2020-08-18 18:39:22,981 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 18:39:22,983 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-18 18:39:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 18:39:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 18:39:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 18:39:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 18:39:23,032 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 18:39:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:23,035 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 18:39:23,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 18:39:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 18:39:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 18:39:23,047 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:23,047 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:23,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 18:39:23,048 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 18:39:23,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:23,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342070964] [2020-08-18 18:39:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-18 18:39:23,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342070964] [2020-08-18 18:39:23,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:23,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 18:39:23,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264113771] [2020-08-18 18:39:23,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 18:39:23,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 18:39:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 18:39:23,560 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 18:39:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:23,979 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 18:39:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 18:39:23,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 18:39:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:23,981 INFO L225 Difference]: With dead ends: 153 [2020-08-18 18:39:23,982 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 18:39:23,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-18 18:39:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 18:39:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 18:39:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 18:39:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 18:39:23,994 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 18:39:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:23,995 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 18:39:23,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 18:39:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 18:39:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 18:39:23,996 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:23,997 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:23,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 18:39:23,997 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 18:39:23,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:23,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660934625] [2020-08-18 18:39:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-18 18:39:24,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660934625] [2020-08-18 18:39:24,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:24,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 18:39:24,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151795069] [2020-08-18 18:39:24,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 18:39:24,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 18:39:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 18:39:24,213 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 18:39:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:24,366 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 18:39:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 18:39:24,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 18:39:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:24,368 INFO L225 Difference]: With dead ends: 68 [2020-08-18 18:39:24,368 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 18:39:24,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-18 18:39:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 18:39:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 18:39:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 18:39:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 18:39:24,378 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 18:39:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:24,378 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 18:39:24,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 18:39:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 18:39:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 18:39:24,380 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:24,381 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:24,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 18:39:24,381 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 18:39:24,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:24,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519506264] [2020-08-18 18:39:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-18 18:39:24,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519506264] [2020-08-18 18:39:24,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:24,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 18:39:24,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668474102] [2020-08-18 18:39:24,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 18:39:24,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 18:39:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 18:39:24,795 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 18:39:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:24,997 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 18:39:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 18:39:24,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 18:39:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:25,001 INFO L225 Difference]: With dead ends: 180 [2020-08-18 18:39:25,001 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 18:39:25,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 18:39:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 18:39:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 18:39:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 18:39:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 18:39:25,023 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 18:39:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:25,025 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 18:39:25,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 18:39:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 18:39:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 18:39:25,031 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:25,031 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-18 18:39:25,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 18:39:25,031 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:25,032 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 18:39:25,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:25,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196660575] [2020-08-18 18:39:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 18:39:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-18 18:39:25,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196660575] [2020-08-18 18:39:25,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:25,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 18:39:25,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178476818] [2020-08-18 18:39:25,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 18:39:25,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 18:39:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 18:39:25,804 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 18:39:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:26,138 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 18:39:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 18:39:26,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 18:39:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:26,147 INFO L225 Difference]: With dead ends: 410 [2020-08-18 18:39:26,147 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 18:39:26,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-18 18:39:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 18:39:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 18:39:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 18:39:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 18:39:26,240 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 18:39:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:26,241 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 18:39:26,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 18:39:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 18:39:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 18:39:26,253 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:26,253 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:26,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 18:39:26,253 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-18 18:39:26,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:26,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2135561894] [2020-08-18 18:39:26,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 18:39:26,416 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 18:39:26,416 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 18:39:26,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 18:39:26,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 06:39:26 BoogieIcfgContainer [2020-08-18 18:39:26,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 18:39:26,516 INFO L168 Benchmark]: Toolchain (without parser) took 6667.75 ms. Allocated memory was 149.9 MB in the beginning and 339.7 MB in the end (delta: 189.8 MB). Free memory was 104.5 MB in the beginning and 230.3 MB in the end (delta: -125.8 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:26,516 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 149.9 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-18 18:39:26,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.55 ms. Allocated memory is still 149.9 MB. Free memory was 104.3 MB in the beginning and 95.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:26,518 INFO L168 Benchmark]: Boogie Preprocessor took 122.31 ms. Allocated memory was 149.9 MB in the beginning and 205.0 MB in the end (delta: 55.1 MB). Free memory was 95.1 MB in the beginning and 183.6 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:26,519 INFO L168 Benchmark]: RCFGBuilder took 250.17 ms. Allocated memory is still 205.0 MB. Free memory was 183.6 MB in the beginning and 172.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:26,519 INFO L168 Benchmark]: TraceAbstraction took 6072.90 ms. Allocated memory was 205.0 MB in the beginning and 339.7 MB in the end (delta: 134.7 MB). Free memory was 171.7 MB in the beginning and 230.3 MB in the end (delta: -58.6 MB). Peak memory consumption was 76.1 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:26,523 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.19 ms. Allocated memory is still 149.9 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 217.55 ms. Allocated memory is still 149.9 MB. Free memory was 104.3 MB in the beginning and 95.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.31 ms. Allocated memory was 149.9 MB in the beginning and 205.0 MB in the end (delta: 55.1 MB). Free memory was 95.1 MB in the beginning and 183.6 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 250.17 ms. Allocated memory is still 205.0 MB. Free memory was 183.6 MB in the beginning and 172.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6072.90 ms. Allocated memory was 205.0 MB in the beginning and 339.7 MB in the end (delta: 134.7 MB). Free memory was 171.7 MB in the beginning and 230.3 MB in the end (delta: -58.6 MB). Peak memory consumption was 76.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.9s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 899 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 243366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 6018/8497 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...