/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 false -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-177f698 [2020-08-21 13:16:46,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 13:16:46,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 13:16:46,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 13:16:46,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 13:16:46,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 13:16:46,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 13:16:46,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 13:16:46,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 13:16:46,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 13:16:46,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 13:16:46,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 13:16:46,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 13:16:46,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 13:16:46,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 13:16:46,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 13:16:46,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 13:16:46,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 13:16:46,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 13:16:46,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 13:16:46,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 13:16:46,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 13:16:46,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 13:16:46,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 13:16:46,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 13:16:46,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 13:16:46,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 13:16:46,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 13:16:46,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 13:16:46,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 13:16:46,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 13:16:46,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 13:16:46,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 13:16:46,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 13:16:46,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 13:16:46,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 13:16:46,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 13:16:46,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 13:16:46,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 13:16:46,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 13:16:46,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 13:16:46,814 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-21 13:16:46,838 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 13:16:46,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 13:16:46,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 13:16:46,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 13:16:46,843 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 13:16:46,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 13:16:46,843 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 13:16:46,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 13:16:46,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 13:16:46,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 13:16:46,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 13:16:46,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 13:16:46,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 13:16:46,848 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 13:16:46,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 13:16:46,848 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 13:16:46,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 13:16:46,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 13:16:46,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 13:16:46,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 13:16:46,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 13:16:46,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 13:16:46,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 13:16:46,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 13:16:46,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 13:16:46,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 13:16:46,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 13:16:46,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 13:16:46,854 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 13:16:46,854 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 -> false [2020-08-21 13:16:47,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 13:16:47,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 13:16:47,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 13:16:47,266 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 13:16:47,267 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 13:16:47,269 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-21 13:16:47,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f3810422b/cb8f4c352ea44bb0a07b7756438f58ec/FLAG1da95a624 [2020-08-21 13:16:47,814 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 13:16:47,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 13:16:47,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f3810422b/cb8f4c352ea44bb0a07b7756438f58ec/FLAG1da95a624 [2020-08-21 13:16:48,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f3810422b/cb8f4c352ea44bb0a07b7756438f58ec [2020-08-21 13:16:48,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 13:16:48,196 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 13:16:48,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 13:16:48,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 13:16:48,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 13:16:48,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dc6253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48, skipping insertion in model container [2020-08-21 13:16:48,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 13:16:48,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 13:16:48,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:16:48,405 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 13:16:48,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:16:48,434 INFO L208 MainTranslator]: Completed translation [2020-08-21 13:16:48,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48 WrapperNode [2020-08-21 13:16:48,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 13:16:48,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 13:16:48,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 13:16:48,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 13:16:48,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (1/1) ... [2020-08-21 13:16:48,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 13:16:48,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 13:16:48,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 13:16:48,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 13:16:48,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (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-21 13:16:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 13:16:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 13:16:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-21 13:16:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 13:16:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 13:16:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 13:16:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-21 13:16:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 13:16:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 13:16:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 13:16:48,813 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 13:16:48,814 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 13:16:48,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:16:48 BoogieIcfgContainer [2020-08-21 13:16:48,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 13:16:48,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 13:16:48,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 13:16:48,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 13:16:48,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 01:16:48" (1/3) ... [2020-08-21 13:16:48,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d35df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:16:48, skipping insertion in model container [2020-08-21 13:16:48,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:16:48" (2/3) ... [2020-08-21 13:16:48,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d35df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:16:48, skipping insertion in model container [2020-08-21 13:16:48,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:16:48" (3/3) ... [2020-08-21 13:16:48,828 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-21 13:16:48,840 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 13:16:48,849 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 13:16:48,865 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 13:16:48,893 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 13:16:48,893 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 13:16:48,894 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 13:16:48,894 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 13:16:48,894 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 13:16:48,894 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 13:16:48,894 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 13:16:48,894 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 13:16:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-21 13:16:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 13:16:48,935 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:48,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:16:48,937 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-21 13:16:48,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:48,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1751537179] [2020-08-21 13:16:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,202 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-21 13:16:49,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1751537179] [2020-08-21 13:16:49,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:16:49,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 13:16:49,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914352070] [2020-08-21 13:16:49,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:16:49,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:16:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:16:49,227 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-21 13:16:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:49,374 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 13:16:49,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 13:16:49,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 13:16:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:49,385 INFO L225 Difference]: With dead ends: 35 [2020-08-21 13:16:49,385 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 13:16:49,388 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-21 13:16:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 13:16:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 13:16:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 13:16:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 13:16:49,433 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 13:16:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:49,434 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 13:16:49,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:16:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 13:16:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 13:16:49,438 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:49,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:16:49,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 13:16:49,439 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-21 13:16:49,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:49,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007164284] [2020-08-21 13:16:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,572 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-21 13:16:49,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007164284] [2020-08-21 13:16:49,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:16:49,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 13:16:49,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733172699] [2020-08-21 13:16:49,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:16:49,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:16:49,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:16:49,581 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 13:16:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:49,663 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 13:16:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 13:16:49,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 13:16:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:49,665 INFO L225 Difference]: With dead ends: 27 [2020-08-21 13:16:49,665 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 13:16:49,667 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-21 13:16:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 13:16:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 13:16:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 13:16:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 13:16:49,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 13:16:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:49,676 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 13:16:49,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:16:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 13:16:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 13:16:49,678 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:49,678 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-21 13:16:49,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 13:16:49,679 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-21 13:16:49,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:49,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860467477] [2020-08-21 13:16:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 13:16:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,816 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-21 13:16:49,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860467477] [2020-08-21 13:16:49,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:49,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 13:16:49,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650323789] [2020-08-21 13:16:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 13:16:49,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 13:16:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 13:16:49,819 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-21 13:16:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:49,906 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 13:16:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 13:16:49,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 13:16:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:49,909 INFO L225 Difference]: With dead ends: 38 [2020-08-21 13:16:49,909 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 13:16:49,910 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-21 13:16:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 13:16:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 13:16:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 13:16:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 13:16:49,919 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 13:16:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:49,920 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 13:16:49,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 13:16:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 13:16:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 13:16:49,922 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:49,922 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-21 13:16:49,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 13:16:49,923 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:49,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-21 13:16:49,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:49,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1651116017] [2020-08-21 13:16:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:49,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,047 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-21 13:16:50,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1651116017] [2020-08-21 13:16:50,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:50,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 13:16:50,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769824711] [2020-08-21 13:16:50,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 13:16:50,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 13:16:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 13:16:50,050 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 13:16:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:50,173 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 13:16:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 13:16:50,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 13:16:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:50,176 INFO L225 Difference]: With dead ends: 41 [2020-08-21 13:16:50,176 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 13:16:50,177 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-21 13:16:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 13:16:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 13:16:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 13:16:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 13:16:50,189 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 13:16:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:50,190 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 13:16:50,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 13:16:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 13:16:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 13:16:50,193 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:50,193 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-21 13:16:50,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 13:16:50,193 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-21 13:16:50,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:50,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522638795] [2020-08-21 13:16:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,421 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-21 13:16:50,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522638795] [2020-08-21 13:16:50,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:50,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:16:50,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343642117] [2020-08-21 13:16:50,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:16:50,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:16:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:16:50,424 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-21 13:16:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:50,539 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-21 13:16:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 13:16:50,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-21 13:16:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:50,542 INFO L225 Difference]: With dead ends: 76 [2020-08-21 13:16:50,542 INFO L226 Difference]: Without dead ends: 45 [2020-08-21 13:16:50,544 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-21 13:16:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-21 13:16:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-21 13:16:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-21 13:16:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-21 13:16:50,557 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-21 13:16:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:50,557 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-21 13:16:50,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:16:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-21 13:16:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 13:16:50,560 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:50,560 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-21 13:16:50,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 13:16:50,561 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-21 13:16:50,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:50,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620798771] [2020-08-21 13:16:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,718 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-21 13:16:50,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620798771] [2020-08-21 13:16:50,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:50,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:16:50,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621393785] [2020-08-21 13:16:50,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:16:50,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:50,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:16:50,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:16:50,722 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-21 13:16:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:50,875 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-21 13:16:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 13:16:50,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 13:16:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:50,878 INFO L225 Difference]: With dead ends: 62 [2020-08-21 13:16:50,879 INFO L226 Difference]: Without dead ends: 58 [2020-08-21 13:16:50,879 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-21 13:16:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-21 13:16:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-21 13:16:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-21 13:16:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-21 13:16:50,894 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-21 13:16:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:50,895 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-21 13:16:50,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:16:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-21 13:16:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 13:16:50,900 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:50,900 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-21 13:16:50,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 13:16:50,900 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-21 13:16:50,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:50,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265077334] [2020-08-21 13:16:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:50,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,244 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-21 13:16:51,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265077334] [2020-08-21 13:16:51,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:51,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 13:16:51,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913925291] [2020-08-21 13:16:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 13:16:51,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 13:16:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 13:16:51,251 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-21 13:16:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:51,448 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-21 13:16:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:16:51,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-21 13:16:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:51,456 INFO L225 Difference]: With dead ends: 97 [2020-08-21 13:16:51,456 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 13:16:51,458 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-21 13:16:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 13:16:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-21 13:16:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-21 13:16:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-21 13:16:51,495 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-21 13:16:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:51,496 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-21 13:16:51,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 13:16:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-21 13:16:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-21 13:16:51,501 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:51,501 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-21 13:16:51,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 13:16:51,501 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-21 13:16:51,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:51,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99755796] [2020-08-21 13:16:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 13:16:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 13:16:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:51,949 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-21 13:16:51,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99755796] [2020-08-21 13:16:51,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:51,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-21 13:16:51,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839679350] [2020-08-21 13:16:51,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 13:16:51,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 13:16:51,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:16:51,955 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-21 13:16:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:52,393 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-21 13:16:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-21 13:16:52,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-21 13:16:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:52,398 INFO L225 Difference]: With dead ends: 153 [2020-08-21 13:16:52,398 INFO L226 Difference]: Without dead ends: 71 [2020-08-21 13:16:52,405 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-21 13:16:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-21 13:16:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-21 13:16:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-21 13:16:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-21 13:16:52,423 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-21 13:16:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:52,424 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-21 13:16:52,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 13:16:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-21 13:16:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-21 13:16:52,431 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:52,431 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-21 13:16:52,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 13:16:52,431 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-21 13:16:52,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:52,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178041748] [2020-08-21 13:16:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 13:16:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:52,749 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-21 13:16:52,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178041748] [2020-08-21 13:16:52,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:52,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 13:16:52,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992166585] [2020-08-21 13:16:52,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 13:16:52,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 13:16:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-21 13:16:52,757 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-21 13:16:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:52,925 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-21 13:16:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 13:16:52,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-21 13:16:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:52,927 INFO L225 Difference]: With dead ends: 68 [2020-08-21 13:16:52,927 INFO L226 Difference]: Without dead ends: 64 [2020-08-21 13:16:52,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-21 13:16:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-21 13:16:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-21 13:16:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-21 13:16:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-21 13:16:52,937 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-21 13:16:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:52,937 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-21 13:16:52,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 13:16:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-21 13:16:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 13:16:52,940 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:52,940 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-21 13:16:52,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 13:16:52,941 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:52,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-21 13:16:52,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:52,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301655795] [2020-08-21 13:16:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 13:16:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 13:16:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,331 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-21 13:16:53,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1301655795] [2020-08-21 13:16:53,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:53,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 13:16:53,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970213560] [2020-08-21 13:16:53,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 13:16:53,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 13:16:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 13:16:53,334 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-21 13:16:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:53,543 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-21 13:16:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 13:16:53,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 13:16:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:53,548 INFO L225 Difference]: With dead ends: 180 [2020-08-21 13:16:53,548 INFO L226 Difference]: Without dead ends: 176 [2020-08-21 13:16:53,549 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-21 13:16:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-21 13:16:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-21 13:16:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-21 13:16:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-21 13:16:53,587 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-21 13:16:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:53,589 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-21 13:16:53,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 13:16:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-21 13:16:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-21 13:16:53,596 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:53,597 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-21 13:16:53,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 13:16:53,597 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-21 13:16:53,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:53,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101413283] [2020-08-21 13:16:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:16:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 13:16:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:53,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 13:16:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 13:16:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 13:16:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 13:16:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 13:16:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 13:16:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 13:16:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:16:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:16:54,522 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-21 13:16:54,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101413283] [2020-08-21 13:16:54,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:16:54,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 13:16:54,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597389125] [2020-08-21 13:16:54,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 13:16:54,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:16:54,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 13:16:54,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-21 13:16:54,526 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-21 13:16:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:16:54,827 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-21 13:16:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 13:16:54,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-21 13:16:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:16:54,835 INFO L225 Difference]: With dead ends: 410 [2020-08-21 13:16:54,835 INFO L226 Difference]: Without dead ends: 406 [2020-08-21 13:16:54,837 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-21 13:16:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-21 13:16:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-21 13:16:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-21 13:16:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-21 13:16:54,895 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-21 13:16:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:16:54,896 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-21 13:16:54,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 13:16:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-21 13:16:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-21 13:16:54,907 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:16:54,908 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-21 13:16:54,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 13:16:54,908 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:16:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:16:54,909 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-21 13:16:54,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:16:54,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384469392] [2020-08-21 13:16:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:16:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 13:16:55,133 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 13:16:55,133 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 13:16:55,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 13:16:55,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 01:16:55 BoogieIcfgContainer [2020-08-21 13:16:55,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 13:16:55,227 INFO L168 Benchmark]: Toolchain (without parser) took 7030.95 ms. Allocated memory was 145.8 MB in the beginning and 366.5 MB in the end (delta: 220.7 MB). Free memory was 102.0 MB in the beginning and 189.4 MB in the end (delta: -87.4 MB). Peak memory consumption was 133.3 MB. Max. memory is 7.1 GB. [2020-08-21 13:16:55,228 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 145.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 13:16:55,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.37 ms. Allocated memory is still 145.8 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-21 13:16:55,230 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 ms. Allocated memory is still 145.8 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-21 13:16:55,231 INFO L168 Benchmark]: RCFGBuilder took 356.72 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 91.0 MB in the beginning and 169.0 MB in the end (delta: -78.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-08-21 13:16:55,231 INFO L168 Benchmark]: TraceAbstraction took 6404.43 ms. Allocated memory was 201.9 MB in the beginning and 366.5 MB in the end (delta: 164.6 MB). Free memory was 168.3 MB in the beginning and 189.4 MB in the end (delta: -21.1 MB). Peak memory consumption was 143.5 MB. Max. memory is 7.1 GB. [2020-08-21 13:16:55,234 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.33 ms. Allocated memory is still 145.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 235.37 ms. Allocated memory is still 145.8 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.85 ms. Allocated memory is still 145.8 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.72 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 91.0 MB in the beginning and 169.0 MB in the end (delta: -78.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6404.43 ms. Allocated memory was 201.9 MB in the beginning and 366.5 MB in the end (delta: 164.6 MB). Free memory was 168.3 MB in the beginning and 189.4 MB in the end (delta: -21.1 MB). Peak memory consumption was 143.5 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: 6.2s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 2.1s, 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, 1.0s 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.4s SatisfiabilityAnalysisTime, 2.8s 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...