/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/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:50,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:50,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:50,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:50,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:50,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:50,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:50,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:50,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:50,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:50,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:50,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:50,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:50,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:50,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:50,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:50,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:50,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:50,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:50,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:50,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:50,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:50,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:50,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:50,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:50,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:50,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:50,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:50,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:50,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:50,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:50,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:50,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:50,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:50,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:50,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:50,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:50,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:50,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:50,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:50,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:50,539 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:50,591 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:50,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:50,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:50,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:50,594 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:50,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:50,594 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:50,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:50,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:50,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:50,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:50,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:50,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:50,595 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:50,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:50,596 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:50,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:50,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:50,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:50,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:50,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:50,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:50,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:50,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:50,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:50,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:50,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:50,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:50,598 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:50,599 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:51,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:51,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:51,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:51,095 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:51,096 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:51,097 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-09-21 10:19:51,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c9b5b899b/7d2367c315324d688de23d0c19dd8506/FLAG997a5c619 [2020-09-21 10:19:51,707 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:51,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-09-21 10:19:51,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c9b5b899b/7d2367c315324d688de23d0c19dd8506/FLAG997a5c619 [2020-09-21 10:19:52,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c9b5b899b/7d2367c315324d688de23d0c19dd8506 [2020-09-21 10:19:52,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:52,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:52,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:52,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:52,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:52,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:52" (1/1) ... [2020-09-21 10:19:52,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1840d501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:52, skipping insertion in model container [2020-09-21 10:19:52,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:52" (1/1) ... [2020-09-21 10:19:52,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:52,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:52,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:52,392 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:52,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:52,438 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:52,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:52 WrapperNode [2020-09-21 10:19:52,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:52,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:52,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:52,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:52,461 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:52" (1/1) ... [2020-09-21 10:19:52,464 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:52" (1/1) ... [2020-09-21 10:19:52,471 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:52" (1/1) ... [2020-09-21 10:19:52,471 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:52" (1/1) ... [2020-09-21 10:19:52,477 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:52" (1/1) ... [2020-09-21 10:19:52,481 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:52" (1/1) ... [2020-09-21 10:19:52,482 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:52" (1/1) ... [2020-09-21 10:19:52,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:52,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:52,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:52,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:52,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:52" (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:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-21 10:19:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-21 10:19:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:52,895 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:52,896 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:52,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:52 BoogieIcfgContainer [2020-09-21 10:19:52,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:52,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:52,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:52,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:52,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:52" (1/3) ... [2020-09-21 10:19:52,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:52, skipping insertion in model container [2020-09-21 10:19:52,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:52" (2/3) ... [2020-09-21 10:19:52,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:52, skipping insertion in model container [2020-09-21 10:19:52,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:52" (3/3) ... [2020-09-21 10:19:52,911 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-09-21 10:19:52,924 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:52,935 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:52,975 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:53,057 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:53,057 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:53,057 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:53,057 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:53,058 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:53,058 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:53,058 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:53,058 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-09-21 10:19:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:53,100 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:53,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:53,102 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-09-21 10:19:53,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:53,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783240600] [2020-09-21 10:19:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,366 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:53,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783240600] [2020-09-21 10:19:53,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:53,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:53,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755245358] [2020-09-21 10:19:53,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:53,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:53,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:53,400 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-09-21 10:19:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:53,489 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-09-21 10:19:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:53,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:53,504 INFO L225 Difference]: With dead ends: 30 [2020-09-21 10:19:53,505 INFO L226 Difference]: Without dead ends: 18 [2020-09-21 10:19:53,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-09-21 10:19:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-09-21 10:19:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-09-21 10:19:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-09-21 10:19:53,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-09-21 10:19:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:53,568 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-09-21 10:19:53,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-09-21 10:19:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:19:53,570 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:53,571 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:53,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:53,571 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-09-21 10:19:53,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:53,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [447016038] [2020-09-21 10:19:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,703 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:53,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [447016038] [2020-09-21 10:19:53,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:53,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:19:53,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648817808] [2020-09-21 10:19:53,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:19:53,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:19:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:53,710 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-09-21 10:19:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:53,772 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-09-21 10:19:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:19:53,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-09-21 10:19:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:53,775 INFO L225 Difference]: With dead ends: 25 [2020-09-21 10:19:53,775 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:19:53,776 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:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:19:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:19:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-09-21 10:19:53,784 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-09-21 10:19:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:53,784 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-09-21 10:19:53,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:19:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-09-21 10:19:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:19:53,786 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:53,786 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:53,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:53,787 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:53,787 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-09-21 10:19:53,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:53,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1284867849] [2020-09-21 10:19:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,990 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:53,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1284867849] [2020-09-21 10:19:53,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:53,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:53,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094249488] [2020-09-21 10:19:53,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:53,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:53,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:53,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:53,993 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-09-21 10:19:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:54,078 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-09-21 10:19:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:54,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-09-21 10:19:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:54,081 INFO L225 Difference]: With dead ends: 28 [2020-09-21 10:19:54,081 INFO L226 Difference]: Without dead ends: 24 [2020-09-21 10:19:54,082 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:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-21 10:19:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-21 10:19:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-21 10:19:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-09-21 10:19:54,090 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-09-21 10:19:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:54,091 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-09-21 10:19:54,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-09-21 10:19:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:19:54,092 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:54,093 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:54,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:54,093 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2020-09-21 10:19:54,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:54,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331506724] [2020-09-21 10:19:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,289 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:54,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331506724] [2020-09-21 10:19:54,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:54,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:54,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389316447] [2020-09-21 10:19:54,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:54,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:54,305 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-09-21 10:19:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:54,391 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-21 10:19:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:19:54,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-09-21 10:19:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:54,393 INFO L225 Difference]: With dead ends: 31 [2020-09-21 10:19:54,394 INFO L226 Difference]: Without dead ends: 27 [2020-09-21 10:19:54,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-09-21 10:19:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-09-21 10:19:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-21 10:19:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-09-21 10:19:54,402 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-09-21 10:19:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:54,402 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-09-21 10:19:54,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-09-21 10:19:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-21 10:19:54,404 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:54,404 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:54,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:19:54,405 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:54,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:54,405 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2020-09-21 10:19:54,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:54,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [89647888] [2020-09-21 10:19:54,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,604 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:54,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [89647888] [2020-09-21 10:19:54,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:54,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:19:54,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924143990] [2020-09-21 10:19:54,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:19:54,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:19:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:19:54,606 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-09-21 10:19:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:54,705 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-21 10:19:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:54,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-09-21 10:19:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:54,707 INFO L225 Difference]: With dead ends: 34 [2020-09-21 10:19:54,707 INFO L226 Difference]: Without dead ends: 30 [2020-09-21 10:19:54,708 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:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-21 10:19:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-21 10:19:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:19:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-21 10:19:54,715 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-09-21 10:19:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:54,716 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-21 10:19:54,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:19:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-21 10:19:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-21 10:19:54,718 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:54,718 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:54,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:19:54,719 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2020-09-21 10:19:54,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:54,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389726720] [2020-09-21 10:19:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,938 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:54,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [389726720] [2020-09-21 10:19:54,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:54,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:19:54,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203005549] [2020-09-21 10:19:54,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:19:54,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:19:54,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:54,941 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-09-21 10:19:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:55,057 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-09-21 10:19:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:19:55,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-09-21 10:19:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:55,060 INFO L225 Difference]: With dead ends: 37 [2020-09-21 10:19:55,060 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:19:55,061 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:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:19:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-21 10:19:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-21 10:19:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-21 10:19:55,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-09-21 10:19:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:55,069 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-21 10:19:55,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:19:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-21 10:19:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-21 10:19:55,071 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:55,071 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:55,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:19:55,072 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2020-09-21 10:19:55,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:55,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053509730] [2020-09-21 10:19:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,349 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:55,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053509730] [2020-09-21 10:19:55,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:55,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:55,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592016852] [2020-09-21 10:19:55,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:55,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:55,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:55,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:55,353 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-09-21 10:19:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:55,487 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-09-21 10:19:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:19:55,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-09-21 10:19:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:55,489 INFO L225 Difference]: With dead ends: 40 [2020-09-21 10:19:55,489 INFO L226 Difference]: Without dead ends: 36 [2020-09-21 10:19:55,491 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:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-21 10:19:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-21 10:19:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-21 10:19:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-09-21 10:19:55,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-09-21 10:19:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:55,500 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-09-21 10:19:55,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-09-21 10:19:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-21 10:19:55,505 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:55,505 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:55,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:19:55,507 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2020-09-21 10:19:55,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:55,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436327654] [2020-09-21 10:19:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,865 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:55,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436327654] [2020-09-21 10:19:55,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:55,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:19:55,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999652491] [2020-09-21 10:19:55,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:19:55,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:19:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:55,872 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-09-21 10:19:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:56,010 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-21 10:19:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:19:56,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-09-21 10:19:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:56,012 INFO L225 Difference]: With dead ends: 43 [2020-09-21 10:19:56,012 INFO L226 Difference]: Without dead ends: 39 [2020-09-21 10:19:56,013 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:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-21 10:19:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-21 10:19:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-21 10:19:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-09-21 10:19:56,020 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-09-21 10:19:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:56,021 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-09-21 10:19:56,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:19:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-09-21 10:19:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:19:56,022 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:56,022 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:56,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:19:56,023 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2020-09-21 10:19:56,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:56,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074512242] [2020-09-21 10:19:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,391 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:56,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074512242] [2020-09-21 10:19:56,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:56,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:19:56,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138329102] [2020-09-21 10:19:56,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:19:56,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:19:56,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:19:56,395 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-09-21 10:19:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:56,570 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-21 10:19:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:19:56,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-09-21 10:19:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:56,572 INFO L225 Difference]: With dead ends: 46 [2020-09-21 10:19:56,572 INFO L226 Difference]: Without dead ends: 42 [2020-09-21 10:19:56,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:19:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-21 10:19:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-21 10:19:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:19:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-21 10:19:56,580 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-09-21 10:19:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:56,580 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-21 10:19:56,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:19:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-21 10:19:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-21 10:19:56,582 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:56,582 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:56,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:19:56,582 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2020-09-21 10:19:56,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:56,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620773404] [2020-09-21 10:19:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,122 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:57,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620773404] [2020-09-21 10:19:57,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:57,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:19:57,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5184871] [2020-09-21 10:19:57,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:19:57,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:57,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:19:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:57,128 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-09-21 10:19:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:57,285 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-21 10:19:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:19:57,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-09-21 10:19:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:57,287 INFO L225 Difference]: With dead ends: 49 [2020-09-21 10:19:57,287 INFO L226 Difference]: Without dead ends: 45 [2020-09-21 10:19:57,288 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:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-21 10:19:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-21 10:19:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-21 10:19:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-21 10:19:57,294 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-09-21 10:19:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:57,295 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-21 10:19:57,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:19:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-21 10:19:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-21 10:19:57,297 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:57,297 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:57,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:19:57,297 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2020-09-21 10:19:57,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:57,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1485948734] [2020-09-21 10:19:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,773 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:57,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1485948734] [2020-09-21 10:19:57,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:57,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-21 10:19:57,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023032027] [2020-09-21 10:19:57,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-21 10:19:57,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:57,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-21 10:19:57,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:19:57,775 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-09-21 10:19:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:57,938 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-09-21 10:19:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-21 10:19:57,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-09-21 10:19:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:57,941 INFO L225 Difference]: With dead ends: 52 [2020-09-21 10:19:57,941 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:19:57,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:19:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:19:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-21 10:19:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-21 10:19:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-21 10:19:57,948 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-09-21 10:19:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:57,949 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-21 10:19:57,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-21 10:19:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-21 10:19:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-21 10:19:57,950 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:57,950 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:57,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:19:57,951 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2020-09-21 10:19:57,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:57,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971410448] [2020-09-21 10:19:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-21 10:19:58,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971410448] [2020-09-21 10:19:58,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:58,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-21 10:19:58,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329968074] [2020-09-21 10:19:58,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-21 10:19:58,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-21 10:19:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:19:58,471 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-09-21 10:19:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:58,713 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-09-21 10:19:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:19:58,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-09-21 10:19:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:58,715 INFO L225 Difference]: With dead ends: 55 [2020-09-21 10:19:58,715 INFO L226 Difference]: Without dead ends: 51 [2020-09-21 10:19:58,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:19:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-09-21 10:19:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-09-21 10:19:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-09-21 10:19:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-09-21 10:19:58,729 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-09-21 10:19:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:58,729 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-09-21 10:19:58,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-21 10:19:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-09-21 10:19:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-21 10:19:58,733 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:58,734 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:58,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:19:58,734 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:58,734 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2020-09-21 10:19:58,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:58,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776883214] [2020-09-21 10:19:58,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-21 10:19:59,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776883214] [2020-09-21 10:19:59,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:59,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:19:59,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202117160] [2020-09-21 10:19:59,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:19:59,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:19:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:19:59,476 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-09-21 10:19:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:59,682 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-09-21 10:19:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-21 10:19:59,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-09-21 10:19:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:59,684 INFO L225 Difference]: With dead ends: 58 [2020-09-21 10:19:59,684 INFO L226 Difference]: Without dead ends: 54 [2020-09-21 10:19:59,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-21 10:19:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-21 10:19:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-21 10:19:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-21 10:19:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-09-21 10:19:59,699 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-09-21 10:19:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:59,700 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-09-21 10:19:59,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:19:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-09-21 10:19:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-21 10:19:59,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:59,702 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:59,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:19:59,703 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2020-09-21 10:19:59,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:59,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1453545510] [2020-09-21 10:19:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-21 10:20:00,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1453545510] [2020-09-21 10:20:00,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:00,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-21 10:20:00,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179501999] [2020-09-21 10:20:00,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-21 10:20:00,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:00,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-21 10:20:00,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:20:00,421 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-09-21 10:20:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:00,641 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-21 10:20:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:20:00,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-09-21 10:20:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:00,643 INFO L225 Difference]: With dead ends: 61 [2020-09-21 10:20:00,643 INFO L226 Difference]: Without dead ends: 57 [2020-09-21 10:20:00,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-21 10:20:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-21 10:20:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-09-21 10:20:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-21 10:20:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-09-21 10:20:00,655 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-09-21 10:20:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:00,658 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-09-21 10:20:00,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-21 10:20:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-09-21 10:20:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 10:20:00,661 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:00,661 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:00,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:20:00,662 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:00,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2020-09-21 10:20:00,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:00,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1239070323] [2020-09-21 10:20:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-21 10:20:01,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1239070323] [2020-09-21 10:20:01,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:01,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-21 10:20:01,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000100614] [2020-09-21 10:20:01,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-21 10:20:01,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-21 10:20:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:20:01,447 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-09-21 10:20:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:01,661 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-21 10:20:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-21 10:20:01,662 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-09-21 10:20:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:01,663 INFO L225 Difference]: With dead ends: 64 [2020-09-21 10:20:01,663 INFO L226 Difference]: Without dead ends: 60 [2020-09-21 10:20:01,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-21 10:20:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-21 10:20:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-21 10:20:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-21 10:20:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-21 10:20:01,670 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-09-21 10:20:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:01,671 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-21 10:20:01,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-21 10:20:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-21 10:20:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-21 10:20:01,672 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:01,672 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:01,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:20:01,673 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2020-09-21 10:20:01,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:01,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750059404] [2020-09-21 10:20:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-21 10:20:02,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750059404] [2020-09-21 10:20:02,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:02,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-21 10:20:02,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129964969] [2020-09-21 10:20:02,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-21 10:20:02,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:02,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-21 10:20:02,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:20:02,522 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-09-21 10:20:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:02,762 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-09-21 10:20:02,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-21 10:20:02,762 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2020-09-21 10:20:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:02,763 INFO L225 Difference]: With dead ends: 67 [2020-09-21 10:20:02,763 INFO L226 Difference]: Without dead ends: 63 [2020-09-21 10:20:02,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-09-21 10:20:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-21 10:20:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-21 10:20:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-21 10:20:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-21 10:20:02,770 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-09-21 10:20:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:02,771 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-21 10:20:02,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-21 10:20:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-21 10:20:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-21 10:20:02,772 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:02,772 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:02,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:20:02,773 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:02,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2020-09-21 10:20:02,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:02,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181646983] [2020-09-21 10:20:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-21 10:20:03,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1181646983] [2020-09-21 10:20:03,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:03,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-21 10:20:03,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730927168] [2020-09-21 10:20:03,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-21 10:20:03,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-21 10:20:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:20:03,692 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-09-21 10:20:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:03,965 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-09-21 10:20:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:20:03,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-09-21 10:20:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:03,967 INFO L225 Difference]: With dead ends: 70 [2020-09-21 10:20:03,967 INFO L226 Difference]: Without dead ends: 66 [2020-09-21 10:20:03,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-21 10:20:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-21 10:20:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-09-21 10:20:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-21 10:20:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-09-21 10:20:03,978 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-09-21 10:20:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:03,978 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-09-21 10:20:03,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-21 10:20:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-09-21 10:20:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-21 10:20:03,979 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:03,980 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:03,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-21 10:20:03,980 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:03,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2020-09-21 10:20:03,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:03,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [216925451] [2020-09-21 10:20:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-21 10:20:04,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [216925451] [2020-09-21 10:20:04,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:04,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-21 10:20:04,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746027699] [2020-09-21 10:20:04,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-21 10:20:04,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-21 10:20:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:20:04,997 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2020-09-21 10:20:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:05,351 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-09-21 10:20:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-21 10:20:05,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2020-09-21 10:20:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:05,353 INFO L225 Difference]: With dead ends: 73 [2020-09-21 10:20:05,353 INFO L226 Difference]: Without dead ends: 69 [2020-09-21 10:20:05,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-21 10:20:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-21 10:20:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-09-21 10:20:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-21 10:20:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-09-21 10:20:05,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-09-21 10:20:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:05,361 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-09-21 10:20:05,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-21 10:20:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-09-21 10:20:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-21 10:20:05,364 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:05,364 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:05,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-21 10:20:05,365 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2020-09-21 10:20:05,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:05,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1033108904] [2020-09-21 10:20:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-21 10:20:06,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1033108904] [2020-09-21 10:20:06,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:06,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-21 10:20:06,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752645658] [2020-09-21 10:20:06,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-21 10:20:06,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-21 10:20:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:20:06,436 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2020-09-21 10:20:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:06,772 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-21 10:20:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-21 10:20:06,772 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2020-09-21 10:20:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:06,773 INFO L225 Difference]: With dead ends: 76 [2020-09-21 10:20:06,773 INFO L226 Difference]: Without dead ends: 72 [2020-09-21 10:20:06,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-21 10:20:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-21 10:20:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-09-21 10:20:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-21 10:20:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-09-21 10:20:06,782 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-09-21 10:20:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:06,782 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-09-21 10:20:06,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-21 10:20:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-09-21 10:20:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-09-21 10:20:06,784 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:06,784 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:06,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-21 10:20:06,784 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:06,785 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2020-09-21 10:20:06,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:06,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475569513] [2020-09-21 10:20:06,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-21 10:20:08,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475569513] [2020-09-21 10:20:08,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:08,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-21 10:20:08,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026758877] [2020-09-21 10:20:08,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-21 10:20:08,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-21 10:20:08,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:20:08,075 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2020-09-21 10:20:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:08,429 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-21 10:20:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-21 10:20:08,429 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2020-09-21 10:20:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:08,430 INFO L225 Difference]: With dead ends: 79 [2020-09-21 10:20:08,431 INFO L226 Difference]: Without dead ends: 75 [2020-09-21 10:20:08,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-21 10:20:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-21 10:20:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-21 10:20:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-21 10:20:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-21 10:20:08,443 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-09-21 10:20:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:08,443 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-21 10:20:08,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-21 10:20:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-21 10:20:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-21 10:20:08,445 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:08,445 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:08,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-21 10:20:08,446 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2020-09-21 10:20:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:08,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846716985] [2020-09-21 10:20:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:20:08,488 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:20:08,488 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:20:08,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-21 10:20:08,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:20:08 BoogieIcfgContainer [2020-09-21 10:20:08,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:20:08,568 INFO L168 Benchmark]: Toolchain (without parser) took 16467.44 ms. Allocated memory was 140.5 MB in the beginning and 451.9 MB in the end (delta: 311.4 MB). Free memory was 103.5 MB in the beginning and 360.0 MB in the end (delta: -256.5 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:08,569 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:20:08,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.02 ms. Allocated memory is still 140.5 MB. Free memory was 102.9 MB in the beginning and 93.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:08,573 INFO L168 Benchmark]: Boogie Preprocessor took 42.20 ms. Allocated memory is still 140.5 MB. Free memory was 93.7 MB in the beginning and 92.3 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:20:08,574 INFO L168 Benchmark]: RCFGBuilder took 416.96 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 92.3 MB in the beginning and 173.2 MB in the end (delta: -80.9 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:08,574 INFO L168 Benchmark]: TraceAbstraction took 15658.83 ms. Allocated memory was 205.5 MB in the beginning and 451.9 MB in the end (delta: 246.4 MB). Free memory was 172.6 MB in the beginning and 360.0 MB in the end (delta: -187.4 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:08,579 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.29 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.02 ms. Allocated memory is still 140.5 MB. Free memory was 102.9 MB in the beginning and 93.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.20 ms. Allocated memory is still 140.5 MB. Free memory was 93.7 MB in the beginning and 92.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.96 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 92.3 MB in the beginning and 173.2 MB in the end (delta: -80.9 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15658.83 ms. Allocated memory was 205.5 MB in the beginning and 451.9 MB in the end (delta: 246.4 MB). Free memory was 172.6 MB in the beginning and 360.0 MB in the end (delta: -187.4 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.4s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 523 SDslu, 1120 SDs, 0 SdLazy, 809 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1533 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 301200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...