/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-89f541c [2020-08-27 21:47:56,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:47:56,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:47:56,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:47:56,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:47:56,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:47:56,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:47:56,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:47:56,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:47:56,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:47:56,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:47:56,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:47:56,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:47:56,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:47:56,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:47:56,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:47:56,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:47:56,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:47:56,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:47:56,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:47:56,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:47:56,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:47:56,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:47:56,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:47:56,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:47:56,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:47:56,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:47:56,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:47:56,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:47:56,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:47:56,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:47:56,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:47:56,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:47:56,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:47:56,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:47:56,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:47:56,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:47:56,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:47:56,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:47:56,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:47:56,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:47:56,097 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-27 21:47:56,124 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:47:56,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:47:56,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:47:56,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:47:56,127 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:47:56,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:47:56,127 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:47:56,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:47:56,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:47:56,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:47:56,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:47:56,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:47:56,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:47:56,128 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:47:56,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:47:56,129 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:47:56,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:47:56,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:47:56,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:47:56,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:47:56,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:47:56,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:47:56,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:47:56,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:47:56,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:47:56,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:47:56,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:47:56,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:47:56,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:47:56,132 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-27 21:47:56,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:47:56,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:47:56,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:47:56,605 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:47:56,605 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:47:56,607 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-27 21:47:56,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/61a841fae/be963840a32342a7ad1d8af29b4ae456/FLAG0b7ea58d0 [2020-08-27 21:47:57,203 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:47:57,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-27 21:47:57,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/61a841fae/be963840a32342a7ad1d8af29b4ae456/FLAG0b7ea58d0 [2020-08-27 21:47:57,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/61a841fae/be963840a32342a7ad1d8af29b4ae456 [2020-08-27 21:47:57,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:47:57,566 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:47:57,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:47:57,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:47:57,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:47:57,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:57,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbac012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57, skipping insertion in model container [2020-08-27 21:47:57,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:57,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:47:57,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:47:57,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:47:57,914 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:47:57,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:47:57,945 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:47:57,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57 WrapperNode [2020-08-27 21:47:57,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:47:57,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:47:57,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:47:57,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:47:57,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:57,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:58,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:58,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:58,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:58,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:58,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (1/1) ... [2020-08-27 21:47:58,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:47:58,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:47:58,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:47:58,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:47:58,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (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-27 21:47:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:47:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:47:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-27 21:47:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:47:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:47:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:47:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-27 21:47:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:47:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:47:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:47:58,351 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:47:58,352 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:47:58,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:47:58 BoogieIcfgContainer [2020-08-27 21:47:58,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:47:58,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:47:58,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:47:58,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:47:58,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:47:57" (1/3) ... [2020-08-27 21:47:58,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ce9302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:47:58, skipping insertion in model container [2020-08-27 21:47:58,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:47:57" (2/3) ... [2020-08-27 21:47:58,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ce9302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:47:58, skipping insertion in model container [2020-08-27 21:47:58,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:47:58" (3/3) ... [2020-08-27 21:47:58,367 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-27 21:47:58,381 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:47:58,394 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:47:58,420 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:47:58,458 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:47:58,458 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:47:58,459 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:47:58,459 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:47:58,459 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:47:58,459 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:47:58,460 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:47:58,460 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:47:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-27 21:47:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-27 21:47:58,501 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:47:58,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:47:58,503 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:47:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:47:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-27 21:47:58,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:47:58,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [247575022] [2020-08-27 21:47:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:47:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:58,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:47:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:58,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:47:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:58,822 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-27 21:47:58,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [247575022] [2020-08-27 21:47:58,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:47:58,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:47:58,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854726967] [2020-08-27 21:47:58,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:47:58,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:47:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:47:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:47:58,850 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-27 21:47:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:47:58,977 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-27 21:47:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:47:58,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-27 21:47:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:47:58,992 INFO L225 Difference]: With dead ends: 35 [2020-08-27 21:47:58,992 INFO L226 Difference]: Without dead ends: 21 [2020-08-27 21:47:58,997 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-27 21:47:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-27 21:47:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-27 21:47:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-27 21:47:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-27 21:47:59,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-27 21:47:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:47:59,052 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-27 21:47:59,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:47:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-27 21:47:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-27 21:47:59,054 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:47:59,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:47:59,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:47:59,055 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:47:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:47:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-27 21:47:59,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:47:59,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901064806] [2020-08-27 21:47:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:47:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:47:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:47:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,154 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-27 21:47:59,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901064806] [2020-08-27 21:47:59,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:47:59,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:47:59,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584699124] [2020-08-27 21:47:59,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:47:59,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:47:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:47:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:47:59,159 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-27 21:47:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:47:59,238 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-27 21:47:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:47:59,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-27 21:47:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:47:59,240 INFO L225 Difference]: With dead ends: 27 [2020-08-27 21:47:59,241 INFO L226 Difference]: Without dead ends: 23 [2020-08-27 21:47:59,242 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-27 21:47:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-27 21:47:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-27 21:47:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-27 21:47:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-27 21:47:59,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-27 21:47:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:47:59,251 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-27 21:47:59,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:47:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-27 21:47:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-27 21:47:59,253 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:47:59,253 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-27 21:47:59,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:47:59,254 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:47:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:47:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-27 21:47:59,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:47:59,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [641130094] [2020-08-27 21:47:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:47:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:47:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:47:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:47:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-27 21:47:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,387 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-27 21:47:59,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [641130094] [2020-08-27 21:47:59,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:47:59,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:47:59,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173787159] [2020-08-27 21:47:59,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:47:59,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:47:59,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:47:59,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:47:59,391 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-27 21:47:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:47:59,496 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-27 21:47:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:47:59,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-27 21:47:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:47:59,499 INFO L225 Difference]: With dead ends: 38 [2020-08-27 21:47:59,499 INFO L226 Difference]: Without dead ends: 23 [2020-08-27 21:47:59,500 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-27 21:47:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-27 21:47:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-27 21:47:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-27 21:47:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-27 21:47:59,508 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-27 21:47:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:47:59,509 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-27 21:47:59,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:47:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-27 21:47:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-27 21:47:59,511 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:47:59,512 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-27 21:47:59,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:47:59,512 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:47:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:47:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-27 21:47:59,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:47:59,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720407742] [2020-08-27 21:47:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:47:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:47:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:47:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:47:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:47:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,696 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-27 21:47:59,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720407742] [2020-08-27 21:47:59,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:47:59,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:47:59,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15388093] [2020-08-27 21:47:59,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:47:59,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:47:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:47:59,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:47:59,700 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-27 21:47:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:47:59,838 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-27 21:47:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:47:59,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-27 21:47:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:47:59,842 INFO L225 Difference]: With dead ends: 41 [2020-08-27 21:47:59,842 INFO L226 Difference]: Without dead ends: 37 [2020-08-27 21:47:59,843 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-27 21:47:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-27 21:47:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-27 21:47:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-27 21:47:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-27 21:47:59,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-27 21:47:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:47:59,856 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-27 21:47:59,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:47:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-27 21:47:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-27 21:47:59,858 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:47:59,859 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-27 21:47:59,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:47:59,859 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:47:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:47:59,860 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-27 21:47:59,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:47:59,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398224000] [2020-08-27 21:47:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:47:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:47:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:47:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:47:59,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:47:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,083 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-27 21:48:00,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398224000] [2020-08-27 21:48:00,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:00,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:48:00,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177517038] [2020-08-27 21:48:00,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:48:00,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:48:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:48:00,086 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-27 21:48:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:00,205 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-27 21:48:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:48:00,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-27 21:48:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:00,208 INFO L225 Difference]: With dead ends: 76 [2020-08-27 21:48:00,209 INFO L226 Difference]: Without dead ends: 45 [2020-08-27 21:48:00,210 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-27 21:48:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-27 21:48:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-27 21:48:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-27 21:48:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-27 21:48:00,223 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-27 21:48:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:00,224 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-27 21:48:00,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:48:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-27 21:48:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-27 21:48:00,226 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:00,226 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-27 21:48:00,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:48:00,227 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-27 21:48:00,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:00,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748132656] [2020-08-27 21:48:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:48:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:48:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,354 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-27 21:48:00,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748132656] [2020-08-27 21:48:00,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:00,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:48:00,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898145588] [2020-08-27 21:48:00,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:48:00,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:48:00,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:48:00,357 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-27 21:48:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:00,501 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-27 21:48:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:48:00,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-27 21:48:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:00,504 INFO L225 Difference]: With dead ends: 62 [2020-08-27 21:48:00,504 INFO L226 Difference]: Without dead ends: 58 [2020-08-27 21:48:00,505 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-27 21:48:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-27 21:48:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-27 21:48:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-27 21:48:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-27 21:48:00,520 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-27 21:48:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:00,521 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-27 21:48:00,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:48:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-27 21:48:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-27 21:48:00,526 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:00,526 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-27 21:48:00,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:48:00,527 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-27 21:48:00,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:00,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1138278599] [2020-08-27 21:48:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:48:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:48:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:00,959 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-27 21:48:00,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1138278599] [2020-08-27 21:48:00,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:00,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:48:00,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670942249] [2020-08-27 21:48:00,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:48:00,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:00,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:48:00,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:48:00,965 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-27 21:48:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:01,160 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-27 21:48:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:48:01,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-27 21:48:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:01,166 INFO L225 Difference]: With dead ends: 97 [2020-08-27 21:48:01,166 INFO L226 Difference]: Without dead ends: 93 [2020-08-27 21:48:01,167 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-27 21:48:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-27 21:48:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-27 21:48:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-27 21:48:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-27 21:48:01,188 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-27 21:48:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:01,189 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-27 21:48:01,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:48:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-27 21:48:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-27 21:48:01,194 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:01,194 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-27 21:48:01,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:48:01,195 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-27 21:48:01,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:01,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1714001950] [2020-08-27 21:48:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:48:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:48:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:01,730 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-27 21:48:01,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1714001950] [2020-08-27 21:48:01,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:01,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-27 21:48:01,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576762834] [2020-08-27 21:48:01,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:48:01,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:01,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:48:01,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:48:01,734 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-27 21:48:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:02,165 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-27 21:48:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-27 21:48:02,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-27 21:48:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:02,169 INFO L225 Difference]: With dead ends: 153 [2020-08-27 21:48:02,169 INFO L226 Difference]: Without dead ends: 71 [2020-08-27 21:48:02,172 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-27 21:48:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-27 21:48:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-27 21:48:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-27 21:48:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-27 21:48:02,183 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-27 21:48:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:02,183 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-27 21:48:02,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:48:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-27 21:48:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-27 21:48:02,185 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:02,186 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-27 21:48:02,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:48:02,186 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-27 21:48:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:02,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099448881] [2020-08-27 21:48:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:48:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:48:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,500 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-27 21:48:02,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099448881] [2020-08-27 21:48:02,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:02,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:48:02,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850924162] [2020-08-27 21:48:02,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:48:02,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:02,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:48:02,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:48:02,503 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-27 21:48:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:02,656 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-27 21:48:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:48:02,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-27 21:48:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:02,658 INFO L225 Difference]: With dead ends: 68 [2020-08-27 21:48:02,658 INFO L226 Difference]: Without dead ends: 64 [2020-08-27 21:48:02,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:48:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-27 21:48:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-27 21:48:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-27 21:48:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-27 21:48:02,668 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-27 21:48:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:02,669 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-27 21:48:02,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:48:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-27 21:48:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-27 21:48:02,672 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:02,672 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-27 21:48:02,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:48:02,672 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-27 21:48:02,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:02,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [392246938] [2020-08-27 21:48:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:48:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:48:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:02,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-27 21:48:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,137 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-27 21:48:03,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [392246938] [2020-08-27 21:48:03,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:03,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:48:03,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878020996] [2020-08-27 21:48:03,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:48:03,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:48:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:48:03,140 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-27 21:48:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:03,411 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-27 21:48:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-27 21:48:03,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-27 21:48:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:03,415 INFO L225 Difference]: With dead ends: 180 [2020-08-27 21:48:03,415 INFO L226 Difference]: Without dead ends: 176 [2020-08-27 21:48:03,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:48:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-27 21:48:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-27 21:48:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-27 21:48:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-27 21:48:03,440 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-27 21:48:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:03,441 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-27 21:48:03,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:48:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-27 21:48:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-27 21:48:03,450 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:03,451 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-27 21:48:03,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:48:03,451 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-27 21:48:03,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:03,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032365727] [2020-08-27 21:48:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:48:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:48:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:03,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-27 21:48:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-27 21:48:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:04,503 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-27 21:48:04,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032365727] [2020-08-27 21:48:04,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:04,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-27 21:48:04,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966200879] [2020-08-27 21:48:04,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:48:04,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:48:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:48:04,506 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-27 21:48:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:04,851 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-27 21:48:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-27 21:48:04,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-27 21:48:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:04,858 INFO L225 Difference]: With dead ends: 410 [2020-08-27 21:48:04,858 INFO L226 Difference]: Without dead ends: 406 [2020-08-27 21:48:04,859 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-27 21:48:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-27 21:48:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-27 21:48:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-27 21:48:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-27 21:48:04,931 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-27 21:48:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:04,932 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-27 21:48:04,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:48:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-27 21:48:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-27 21:48:04,946 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:04,946 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:48:04,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:48:04,947 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-27 21:48:04,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:04,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2135642532] [2020-08-27 21:48:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:48:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:48:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-27 21:48:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:05,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-27 21:48:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-27 21:48:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:48:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-27 21:48:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-27 21:48:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:48:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:48:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:48:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:06,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:48:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:48:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-27 21:48:07,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2135642532] [2020-08-27 21:48:07,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:48:07,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-27 21:48:07,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383867031] [2020-08-27 21:48:07,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-27 21:48:07,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:48:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-27 21:48:07,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:48:07,119 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-27 21:48:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:48:08,141 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-27 21:48:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-27 21:48:08,142 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-27 21:48:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:48:08,148 INFO L225 Difference]: With dead ends: 531 [2020-08-27 21:48:08,149 INFO L226 Difference]: Without dead ends: 148 [2020-08-27 21:48:08,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-27 21:48:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-27 21:48:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-27 21:48:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-27 21:48:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-27 21:48:08,165 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-27 21:48:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:48:08,166 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-27 21:48:08,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-27 21:48:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-27 21:48:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-27 21:48:08,175 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:48:08,176 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-27 21:48:08,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:48:08,176 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:48:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:48:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-27 21:48:08,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:48:08,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570631421] [2020-08-27 21:48:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:48:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-27 21:48:08,328 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-27 21:48:08,328 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-27 21:48:08,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:48:08,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:48:08 BoogieIcfgContainer [2020-08-27 21:48:08,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:48:08,435 INFO L168 Benchmark]: Toolchain (without parser) took 10863.17 ms. Allocated memory was 146.8 MB in the beginning and 491.8 MB in the end (delta: 345.0 MB). Free memory was 101.7 MB in the beginning and 134.2 MB in the end (delta: -32.5 MB). Peak memory consumption was 312.5 MB. Max. memory is 7.1 GB. [2020-08-27 21:48:08,436 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-27 21:48:08,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.71 ms. Allocated memory is still 146.8 MB. Free memory was 101.5 MB in the beginning and 91.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-08-27 21:48:08,437 INFO L168 Benchmark]: Boogie Preprocessor took 123.33 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 91.7 MB in the beginning and 182.1 MB in the end (delta: -90.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-08-27 21:48:08,438 INFO L168 Benchmark]: RCFGBuilder took 286.76 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 169.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:48:08,446 INFO L168 Benchmark]: TraceAbstraction took 10068.94 ms. Allocated memory was 202.9 MB in the beginning and 491.8 MB in the end (delta: 288.9 MB). Free memory was 169.0 MB in the beginning and 134.2 MB in the end (delta: 34.9 MB). Peak memory consumption was 323.8 MB. Max. memory is 7.1 GB. [2020-08-27 21:48:08,453 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.21 ms. Allocated memory is still 146.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 376.71 ms. Allocated memory is still 146.8 MB. Free memory was 101.5 MB in the beginning and 91.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.33 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 91.7 MB in the beginning and 182.1 MB in the end (delta: -90.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 286.76 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 169.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10068.94 ms. Allocated memory was 202.9 MB in the beginning and 491.8 MB in the end (delta: 288.9 MB). Free memory was 169.0 MB in the beginning and 134.2 MB in the end (delta: 34.9 MB). Peak memory consumption was 323.8 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: 9.8s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1339 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.7s 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, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 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...