/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-simple/id_i10_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:31,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:31,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:31,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:31,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:31,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:31,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:31,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:31,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:31,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:31,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:31,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:31,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:31,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:31,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:31,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:31,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:31,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:31,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:31,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:31,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:31,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:31,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:31,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:31,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:31,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:31,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:31,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:31,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:31,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:31,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:31,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:31,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:31,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:31,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:31,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:31,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:31,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:31,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:31,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:31,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:31,562 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-09-21 10:19:31,597 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:31,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:31,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:31,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:31,600 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:31,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:31,601 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:31,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:31,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:31,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:31,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:31,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:31,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:31,603 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:31,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:31,603 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:31,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:31,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:31,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:31,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:31,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:31,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:31,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:31,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:31,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:31,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:31,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:31,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:31,608 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:31,608 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-09-21 10:19:32,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:32,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:32,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:32,169 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:32,170 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:32,172 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-09-21 10:19:32,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/826c1a9ce/8abd3b8dc3a4455aacfd8a196dff4da9/FLAGaab15345a [2020-09-21 10:19:32,798 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:32,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-09-21 10:19:32,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/826c1a9ce/8abd3b8dc3a4455aacfd8a196dff4da9/FLAGaab15345a [2020-09-21 10:19:33,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/826c1a9ce/8abd3b8dc3a4455aacfd8a196dff4da9 [2020-09-21 10:19:33,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:33,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:33,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:33,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:33,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:33,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee2931e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33, skipping insertion in model container [2020-09-21 10:19:33,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:33,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:33,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:33,463 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:33,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:33,505 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:33,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33 WrapperNode [2020-09-21 10:19:33,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:33,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:33,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:33,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:33,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (1/1) ... [2020-09-21 10:19:33,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:33,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:33,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:33,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:33,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (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-09-21 10:19:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-21 10:19:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:19:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-21 10:19:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:33,895 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:33,895 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:33,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:33 BoogieIcfgContainer [2020-09-21 10:19:33,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:33,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:33,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:33,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:33,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:33" (1/3) ... [2020-09-21 10:19:33,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490f64cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:33, skipping insertion in model container [2020-09-21 10:19:33,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:33" (2/3) ... [2020-09-21 10:19:33,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490f64cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:33, skipping insertion in model container [2020-09-21 10:19:33,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:33" (3/3) ... [2020-09-21 10:19:33,909 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2020-09-21 10:19:33,920 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:33,930 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:33,952 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:33,982 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:33,982 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:33,983 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:33,983 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:33,983 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:33,983 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:33,983 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:33,983 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-09-21 10:19:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:34,015 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:34,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:34,017 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:34,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-09-21 10:19:34,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:34,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942631725] [2020-09-21 10:19:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:34,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942631725] [2020-09-21 10:19:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:34,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:34,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287190232] [2020-09-21 10:19:34,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:34,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:34,390 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-09-21 10:19:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:34,477 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-09-21 10:19:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:34,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:34,492 INFO L225 Difference]: With dead ends: 30 [2020-09-21 10:19:34,492 INFO L226 Difference]: Without dead ends: 18 [2020-09-21 10:19:34,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-09-21 10:19:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-09-21 10:19:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-09-21 10:19:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-09-21 10:19:34,541 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-09-21 10:19:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:34,542 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-09-21 10:19:34,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-09-21 10:19:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:19:34,545 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:34,545 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:34,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:34,546 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-09-21 10:19:34,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:34,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464439163] [2020-09-21 10:19:34,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-21 10:19:34,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464439163] [2020-09-21 10:19:34,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:34,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:19:34,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953770431] [2020-09-21 10:19:34,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:19:34,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:19:34,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:34,687 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-09-21 10:19:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:34,757 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-09-21 10:19:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:19:34,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-09-21 10:19:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:34,760 INFO L225 Difference]: With dead ends: 25 [2020-09-21 10:19:34,760 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:19:34,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-09-21 10:19:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:19:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:19:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-09-21 10:19:34,769 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-09-21 10:19:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:34,769 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-09-21 10:19:34,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:19:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-09-21 10:19:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:19:34,771 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:34,771 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:34,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:34,772 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:34,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-09-21 10:19:34,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:34,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544312683] [2020-09-21 10:19:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:34,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-21 10:19:35,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544312683] [2020-09-21 10:19:35,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:35,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:35,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232444225] [2020-09-21 10:19:35,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:35,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:35,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:35,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:35,011 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-09-21 10:19:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:35,105 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-09-21 10:19:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:35,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-09-21 10:19:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:35,107 INFO L225 Difference]: With dead ends: 28 [2020-09-21 10:19:35,107 INFO L226 Difference]: Without dead ends: 24 [2020-09-21 10:19:35,108 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-09-21 10:19:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-21 10:19:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-21 10:19:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-21 10:19:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-09-21 10:19:35,115 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-09-21 10:19:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:35,116 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-09-21 10:19:35,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-09-21 10:19:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:19:35,117 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:35,117 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:35,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:35,118 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:35,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-09-21 10:19:35,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:35,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210014184] [2020-09-21 10:19:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-21 10:19:35,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [210014184] [2020-09-21 10:19:35,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:35,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:35,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074812132] [2020-09-21 10:19:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:35,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:35,299 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-09-21 10:19:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:35,406 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-21 10:19:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:19:35,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-09-21 10:19:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:35,408 INFO L225 Difference]: With dead ends: 31 [2020-09-21 10:19:35,408 INFO L226 Difference]: Without dead ends: 27 [2020-09-21 10:19:35,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-09-21 10:19:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-09-21 10:19:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-21 10:19:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-09-21 10:19:35,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-09-21 10:19:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:35,417 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-09-21 10:19:35,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-09-21 10:19:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-21 10:19:35,419 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:35,420 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:35,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:19:35,420 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-09-21 10:19:35,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:35,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1669009581] [2020-09-21 10:19:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-21 10:19:35,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1669009581] [2020-09-21 10:19:35,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:35,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:19:35,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036699848] [2020-09-21 10:19:35,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:19:35,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:19:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:19:35,654 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-09-21 10:19:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:35,756 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-21 10:19:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:35,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-09-21 10:19:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:35,760 INFO L225 Difference]: With dead ends: 34 [2020-09-21 10:19:35,760 INFO L226 Difference]: Without dead ends: 30 [2020-09-21 10:19:35,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-21 10:19:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-21 10:19:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:19:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-21 10:19:35,776 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-09-21 10:19:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:35,780 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-21 10:19:35,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:19:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-21 10:19:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-21 10:19:35,784 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:35,784 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:35,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:19:35,785 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-09-21 10:19:35,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:35,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675079889] [2020-09-21 10:19:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:35,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-21 10:19:36,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675079889] [2020-09-21 10:19:36,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:36,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:19:36,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052685896] [2020-09-21 10:19:36,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:19:36,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:19:36,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:36,061 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-09-21 10:19:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:36,172 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-09-21 10:19:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:19:36,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-09-21 10:19:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:36,175 INFO L225 Difference]: With dead ends: 37 [2020-09-21 10:19:36,176 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:19:36,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 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-09-21 10:19:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:19:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-21 10:19:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-21 10:19:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-21 10:19:36,190 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-09-21 10:19:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:36,191 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-21 10:19:36,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:19:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-21 10:19:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-21 10:19:36,195 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:36,195 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:36,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:19:36,196 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-09-21 10:19:36,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:36,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835708151] [2020-09-21 10:19:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-21 10:19:36,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835708151] [2020-09-21 10:19:36,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:36,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:36,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525020981] [2020-09-21 10:19:36,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:36,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:36,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:36,499 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-09-21 10:19:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:36,635 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-09-21 10:19:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:19:36,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-09-21 10:19:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:36,638 INFO L225 Difference]: With dead ends: 40 [2020-09-21 10:19:36,638 INFO L226 Difference]: Without dead ends: 36 [2020-09-21 10:19:36,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 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-09-21 10:19:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-21 10:19:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-21 10:19:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-21 10:19:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-09-21 10:19:36,646 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-09-21 10:19:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:36,646 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-09-21 10:19:36,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-09-21 10:19:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-21 10:19:36,648 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:36,648 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:36,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:19:36,648 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:36,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-09-21 10:19:36,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:36,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402680344] [2020-09-21 10:19:36,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-21 10:19:36,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402680344] [2020-09-21 10:19:36,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:36,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:19:36,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133622635] [2020-09-21 10:19:36,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:19:36,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:36,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:19:36,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:36,900 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-09-21 10:19:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:37,012 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-21 10:19:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:19:37,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-09-21 10:19:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:37,014 INFO L225 Difference]: With dead ends: 43 [2020-09-21 10:19:37,014 INFO L226 Difference]: Without dead ends: 39 [2020-09-21 10:19:37,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:19:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-21 10:19:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-21 10:19:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-21 10:19:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-09-21 10:19:37,021 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-09-21 10:19:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:37,022 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-09-21 10:19:37,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:19:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-09-21 10:19:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:19:37,023 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:37,024 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:37,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:19:37,024 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-09-21 10:19:37,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:37,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [264304418] [2020-09-21 10:19:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-21 10:19:37,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [264304418] [2020-09-21 10:19:37,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:37,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:19:37,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979113695] [2020-09-21 10:19:37,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:19:37,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:37,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:19:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:19:37,316 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-09-21 10:19:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:37,451 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-21 10:19:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:19:37,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-09-21 10:19:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:37,463 INFO L225 Difference]: With dead ends: 46 [2020-09-21 10:19:37,463 INFO L226 Difference]: Without dead ends: 42 [2020-09-21 10:19:37,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:19:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-21 10:19:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-21 10:19:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:19:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-21 10:19:37,472 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-09-21 10:19:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:37,473 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-21 10:19:37,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:19:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-21 10:19:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-21 10:19:37,474 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:37,474 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:37,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:19:37,475 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-09-21 10:19:37,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:37,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1714787367] [2020-09-21 10:19:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-21 10:19:37,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1714787367] [2020-09-21 10:19:37,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:37,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:19:37,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529126573] [2020-09-21 10:19:37,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:19:37,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:19:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:37,805 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-09-21 10:19:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:37,958 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-21 10:19:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:19:37,959 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-09-21 10:19:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:37,960 INFO L225 Difference]: With dead ends: 49 [2020-09-21 10:19:37,960 INFO L226 Difference]: Without dead ends: 45 [2020-09-21 10:19:37,961 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:19:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-21 10:19:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-21 10:19:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-21 10:19:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-21 10:19:37,967 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-09-21 10:19:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:37,968 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-21 10:19:37,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:19:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-21 10:19:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-21 10:19:37,969 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:37,970 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:37,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:19:37,970 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-09-21 10:19:37,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:37,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793629938] [2020-09-21 10:19:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-21 10:19:38,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793629938] [2020-09-21 10:19:38,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:38,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-21 10:19:38,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100210979] [2020-09-21 10:19:38,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-21 10:19:38,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-21 10:19:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:19:38,753 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 25 states. [2020-09-21 10:19:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:39,030 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-09-21 10:19:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-21 10:19:39,030 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2020-09-21 10:19:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:39,032 INFO L225 Difference]: With dead ends: 52 [2020-09-21 10:19:39,032 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:19:39,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:19:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:19:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-21 10:19:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-21 10:19:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-21 10:19:39,039 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-09-21 10:19:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:39,040 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-21 10:19:39,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-21 10:19:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-21 10:19:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-21 10:19:39,041 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:39,041 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:39,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:19:39,042 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-09-21 10:19:39,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:39,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436344274] [2020-09-21 10:19:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 165 proven. 22 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-21 10:19:39,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436344274] [2020-09-21 10:19:39,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:39,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-21 10:19:39,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220686763] [2020-09-21 10:19:39,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-21 10:19:39,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-21 10:19:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:19:39,539 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-09-21 10:19:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:39,770 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-09-21 10:19:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:19:39,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-09-21 10:19:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:39,772 INFO L225 Difference]: With dead ends: 48 [2020-09-21 10:19:39,772 INFO L226 Difference]: Without dead ends: 0 [2020-09-21 10:19:39,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:19:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-21 10:19:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-21 10:19:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-21 10:19:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-21 10:19:39,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2020-09-21 10:19:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:39,775 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-21 10:19:39,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-21 10:19:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-21 10:19:39,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-21 10:19:39,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:19:39,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-21 10:19:39,806 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-21 10:19:39,807 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:19:39,807 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:19:39,807 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-21 10:19:39,807 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-21 10:19:39,807 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:19:39,807 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-09-21 10:19:39,807 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-09-21 10:19:39,808 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 15) no Hoare annotation was computed. [2020-09-21 10:19:39,808 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-09-21 10:19:39,808 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-09-21 10:19:39,808 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= 10 main_~input~0) (<= main_~input~0 10)) [2020-09-21 10:19:39,808 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-09-21 10:19:39,809 INFO L268 CegarLoopResult]: For program point L12-2(lines 9 15) no Hoare annotation was computed. [2020-09-21 10:19:39,809 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-09-21 10:19:39,809 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-09-21 10:19:39,809 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-09-21 10:19:39,809 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-21 10:19:39,809 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-09-21 10:19:39,809 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-09-21 10:19:39,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:19:39 BoogieIcfgContainer [2020-09-21 10:19:39,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:19:39,821 INFO L168 Benchmark]: Toolchain (without parser) took 6646.78 ms. Allocated memory was 135.8 MB in the beginning and 312.0 MB in the end (delta: 176.2 MB). Free memory was 98.7 MB in the beginning and 204.6 MB in the end (delta: -105.9 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:39,821 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory was 117.3 MB in the beginning and 117.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-21 10:19:39,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.61 ms. Allocated memory is still 135.8 MB. Free memory was 98.0 MB in the beginning and 88.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:39,823 INFO L168 Benchmark]: Boogie Preprocessor took 32.46 ms. Allocated memory is still 135.8 MB. Free memory was 88.8 MB in the beginning and 87.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:39,824 INFO L168 Benchmark]: RCFGBuilder took 360.54 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 87.5 MB in the beginning and 166.7 MB in the end (delta: -79.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:39,825 INFO L168 Benchmark]: TraceAbstraction took 5916.29 ms. Allocated memory was 198.7 MB in the beginning and 312.0 MB in the end (delta: 113.2 MB). Free memory was 166.7 MB in the beginning and 204.6 MB in the end (delta: -37.9 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:39,829 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.22 ms. Allocated memory is still 135.8 MB. Free memory was 117.3 MB in the beginning and 117.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.61 ms. Allocated memory is still 135.8 MB. Free memory was 98.0 MB in the beginning and 88.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.46 ms. Allocated memory is still 135.8 MB. Free memory was 88.8 MB in the beginning and 87.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.54 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 87.5 MB in the beginning and 166.7 MB in the end (delta: -79.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5916.29 ms. Allocated memory was 198.7 MB in the beginning and 312.0 MB in the end (delta: 113.2 MB). Free memory was 166.7 MB in the beginning and 204.6 MB in the end (delta: -37.9 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.7s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 200 SDtfs, 167 SDslu, 1215 SDs, 0 SdLazy, 702 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 15 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 78096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 957/1584 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 correct! Received shutdown request...