/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_25x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:56,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:56,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:56,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:56,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:56,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:56,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:56,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:56,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:56,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:56,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:56,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:56,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:56,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:56,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:56,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:56,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:56,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:56,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:56,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:56,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:56,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:56,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:56,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:56,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:56,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:56,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:56,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:56,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:56,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:56,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:56,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:56,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:56,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:56,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:56,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:56,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:56,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:56,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:56,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:56,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:56,140 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:56,168 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:56,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:56,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:56,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:56,171 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:56,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:56,171 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:56,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:56,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:56,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:56,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:56,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:56,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:56,173 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:56,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:56,173 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:56,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:56,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:56,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:56,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:56,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:56,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:56,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:56,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:56,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:56,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:56,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:56,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:56,176 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:56,176 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:56,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:56,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:56,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:56,721 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:56,722 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:56,724 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_25x0-2.c [2020-09-21 10:19:56,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c36de72bf/c7b06b8ff8ca4afc89f54f6c18ca18a6/FLAGbc531b4b0 [2020-09-21 10:19:57,382 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:57,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_25x0-2.c [2020-09-21 10:19:57,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c36de72bf/c7b06b8ff8ca4afc89f54f6c18ca18a6/FLAGbc531b4b0 [2020-09-21 10:19:57,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c36de72bf/c7b06b8ff8ca4afc89f54f6c18ca18a6 [2020-09-21 10:19:57,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:57,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:57,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:57,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:57,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:57,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:57" (1/1) ... [2020-09-21 10:19:57,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4231a4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:57, skipping insertion in model container [2020-09-21 10:19:57,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:57" (1/1) ... [2020-09-21 10:19:57,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:57,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:58,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:58,016 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:58,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:58,053 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:58,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:58 WrapperNode [2020-09-21 10:19:58,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:58,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:58,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:58,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:58,074 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:58" (1/1) ... [2020-09-21 10:19:58,074 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:58" (1/1) ... [2020-09-21 10:19:58,081 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:58" (1/1) ... [2020-09-21 10:19:58,081 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:58" (1/1) ... [2020-09-21 10:19:58,086 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:58" (1/1) ... [2020-09-21 10:19:58,089 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:58" (1/1) ... [2020-09-21 10:19:58,090 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:58" (1/1) ... [2020-09-21 10:19:58,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:58,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:58,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:58,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:58,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:58" (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:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-21 10:19:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-21 10:19:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:58,452 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:58,452 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:58,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:58 BoogieIcfgContainer [2020-09-21 10:19:58,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:58,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:58,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:58,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:58,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:57" (1/3) ... [2020-09-21 10:19:58,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e37694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:58, skipping insertion in model container [2020-09-21 10:19:58,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:58" (2/3) ... [2020-09-21 10:19:58,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e37694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:58, skipping insertion in model container [2020-09-21 10:19:58,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:58" (3/3) ... [2020-09-21 10:19:58,471 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2020-09-21 10:19:58,492 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:58,503 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:58,529 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:58,570 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:58,570 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:58,570 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:58,570 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:58,570 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:58,571 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:58,571 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:58,571 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-09-21 10:19:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:58,625 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:58,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:58,631 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-09-21 10:19:58,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:58,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735858941] [2020-09-21 10:19:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,937 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:58,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735858941] [2020-09-21 10:19:58,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:58,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:58,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374862988] [2020-09-21 10:19:58,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:58,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:58,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:58,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:58,965 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-09-21 10:19:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:59,085 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-09-21 10:19:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:59,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:59,101 INFO L225 Difference]: With dead ends: 30 [2020-09-21 10:19:59,101 INFO L226 Difference]: Without dead ends: 18 [2020-09-21 10:19:59,106 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:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-09-21 10:19:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-09-21 10:19:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-09-21 10:19:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-09-21 10:19:59,163 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-09-21 10:19:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:59,163 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-09-21 10:19:59,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-09-21 10:19:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:19:59,167 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:59,167 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:59,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:59,168 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-09-21 10:19:59,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:59,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1232365162] [2020-09-21 10:19:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,300 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:59,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1232365162] [2020-09-21 10:19:59,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:59,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:19:59,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040182469] [2020-09-21 10:19:59,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:19:59,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:59,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:19:59,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:59,305 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-09-21 10:19:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:59,364 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-09-21 10:19:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:19:59,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-09-21 10:19:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:59,366 INFO L225 Difference]: With dead ends: 25 [2020-09-21 10:19:59,366 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:19:59,368 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:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:19:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:19:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-09-21 10:19:59,375 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-09-21 10:19:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:59,376 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-09-21 10:19:59,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:19:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-09-21 10:19:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:19:59,377 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:59,377 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:59,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:59,378 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-09-21 10:19:59,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:59,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [876860698] [2020-09-21 10:19:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,615 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:59,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [876860698] [2020-09-21 10:19:59,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:59,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:59,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033389185] [2020-09-21 10:19:59,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:59,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:59,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:59,618 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-09-21 10:19:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:59,684 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-09-21 10:19:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:59,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-09-21 10:19:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:59,686 INFO L225 Difference]: With dead ends: 28 [2020-09-21 10:19:59,686 INFO L226 Difference]: Without dead ends: 24 [2020-09-21 10:19:59,687 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:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-21 10:19:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-21 10:19:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-21 10:19:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-09-21 10:19:59,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-09-21 10:19:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:59,694 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-09-21 10:19:59,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-09-21 10:19:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:19:59,696 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:59,696 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:59,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:59,697 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:59,697 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2020-09-21 10:19:59,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:59,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464875976] [2020-09-21 10:19:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,950 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:59,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464875976] [2020-09-21 10:19:59,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:59,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:59,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697396763] [2020-09-21 10:19:59,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:59,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:59,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:59,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:59,956 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-09-21 10:20:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:00,071 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-21 10:20:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:20:00,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-09-21 10:20:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:00,074 INFO L225 Difference]: With dead ends: 31 [2020-09-21 10:20:00,074 INFO L226 Difference]: Without dead ends: 27 [2020-09-21 10:20:00,075 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:20:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-09-21 10:20:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-09-21 10:20:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-21 10:20:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-09-21 10:20:00,091 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-09-21 10:20:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:00,091 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-09-21 10:20:00,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:20:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-09-21 10:20:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-21 10:20:00,095 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:00,095 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:20:00,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:20:00,096 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:00,096 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2020-09-21 10:20:00,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:00,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [635543971] [2020-09-21 10:20:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,307 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:20:00,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [635543971] [2020-09-21 10:20:00,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:00,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:20:00,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488420467] [2020-09-21 10:20:00,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:20:00,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:00,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:20:00,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:20:00,310 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-09-21 10:20:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:00,401 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-21 10:20:00,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:20:00,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-09-21 10:20:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:00,404 INFO L225 Difference]: With dead ends: 34 [2020-09-21 10:20:00,404 INFO L226 Difference]: Without dead ends: 30 [2020-09-21 10:20:00,405 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:20:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-21 10:20:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-21 10:20:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:20:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-21 10:20:00,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-09-21 10:20:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:00,412 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-21 10:20:00,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:20:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-21 10:20:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-21 10:20:00,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:00,414 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:20:00,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:20:00,414 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2020-09-21 10:20:00,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:00,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1864903482] [2020-09-21 10:20:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,611 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:20:00,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1864903482] [2020-09-21 10:20:00,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:00,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:20:00,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165465746] [2020-09-21 10:20:00,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:20:00,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:00,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:20:00,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:20:00,614 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-09-21 10:20:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:00,709 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-09-21 10:20:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:20:00,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-09-21 10:20:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:00,711 INFO L225 Difference]: With dead ends: 37 [2020-09-21 10:20:00,711 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:20:00,712 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:20:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:20:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-21 10:20:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-21 10:20:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-21 10:20:00,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-09-21 10:20:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:00,720 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-21 10:20:00,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:20:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-21 10:20:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-21 10:20:00,722 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:00,722 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:20:00,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:20:00,722 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2020-09-21 10:20:00,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:00,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127247235] [2020-09-21 10:20:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,023 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:20:01,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127247235] [2020-09-21 10:20:01,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:01,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:20:01,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814000304] [2020-09-21 10:20:01,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:20:01,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:20:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:20:01,027 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-09-21 10:20:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:01,155 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-09-21 10:20:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:20:01,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-09-21 10:20:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:01,157 INFO L225 Difference]: With dead ends: 40 [2020-09-21 10:20:01,157 INFO L226 Difference]: Without dead ends: 36 [2020-09-21 10:20:01,159 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:20:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-21 10:20:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-21 10:20:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-21 10:20:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-09-21 10:20:01,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-09-21 10:20:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:01,175 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-09-21 10:20:01,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:20:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-09-21 10:20:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-21 10:20:01,180 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:01,180 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:20:01,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:20:01,180 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2020-09-21 10:20:01,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:01,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [679404580] [2020-09-21 10:20:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,534 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:20:01,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [679404580] [2020-09-21 10:20:01,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:01,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:20:01,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953093452] [2020-09-21 10:20:01,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:20:01,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:01,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:20:01,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:20:01,541 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-09-21 10:20:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:01,666 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-21 10:20:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:20:01,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-09-21 10:20:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:01,668 INFO L225 Difference]: With dead ends: 43 [2020-09-21 10:20:01,668 INFO L226 Difference]: Without dead ends: 39 [2020-09-21 10:20:01,670 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:20:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-21 10:20:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-21 10:20:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-21 10:20:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-09-21 10:20:01,683 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-09-21 10:20:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:01,686 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-09-21 10:20:01,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:20:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-09-21 10:20:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:20:01,689 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:01,689 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:20:01,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:20:01,689 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2020-09-21 10:20:01,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:01,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855437681] [2020-09-21 10:20:01,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:01,706 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,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,867 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,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,019 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:20:02,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855437681] [2020-09-21 10:20:02,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:02,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:20:02,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400706659] [2020-09-21 10:20:02,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:20:02,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:20:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:20:02,022 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-09-21 10:20:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:02,160 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-21 10:20:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:20:02,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-09-21 10:20:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:02,162 INFO L225 Difference]: With dead ends: 46 [2020-09-21 10:20:02,162 INFO L226 Difference]: Without dead ends: 42 [2020-09-21 10:20:02,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:20:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-21 10:20:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-21 10:20:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:20:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-21 10:20:02,169 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-09-21 10:20:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:02,170 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-21 10:20:02,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:20:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-21 10:20:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-21 10:20:02,171 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:02,171 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:20:02,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:20:02,172 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2020-09-21 10:20:02,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:02,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1231592526] [2020-09-21 10:20:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,273 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,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,563 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:20:02,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1231592526] [2020-09-21 10:20:02,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:02,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:20:02,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136774462] [2020-09-21 10:20:02,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:20:02,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:02,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:20:02,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:20:02,566 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-09-21 10:20:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:02,704 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-21 10:20:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:20:02,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-09-21 10:20:02,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:02,706 INFO L225 Difference]: With dead ends: 49 [2020-09-21 10:20:02,706 INFO L226 Difference]: Without dead ends: 45 [2020-09-21 10:20:02,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:20:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-21 10:20:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-21 10:20:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-21 10:20:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-21 10:20:02,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-09-21 10:20:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:02,713 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-21 10:20:02,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:20:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-21 10:20:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-21 10:20:02,715 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:02,715 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:20:02,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:20:02,715 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2020-09-21 10:20:02,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:02,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879061475] [2020-09-21 10:20:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,149 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:20:03,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879061475] [2020-09-21 10:20:03,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:03,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-21 10:20:03,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532966607] [2020-09-21 10:20:03,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-21 10:20:03,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:03,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-21 10:20:03,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:20:03,153 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-09-21 10:20:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:03,340 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-09-21 10:20:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-21 10:20:03,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-09-21 10:20:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:03,343 INFO L225 Difference]: With dead ends: 52 [2020-09-21 10:20:03,343 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:20:03,345 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:20:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:20:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-21 10:20:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-21 10:20:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-21 10:20:03,352 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-09-21 10:20:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:03,352 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-21 10:20:03,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-21 10:20:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-21 10:20:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-21 10:20:03,354 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:03,354 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:20:03,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:20:03,354 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2020-09-21 10:20:03,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:03,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852987577] [2020-09-21 10:20:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,497 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,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,916 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:20:03,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1852987577] [2020-09-21 10:20:03,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:03,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-21 10:20:03,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054385966] [2020-09-21 10:20:03,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-21 10:20:03,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-21 10:20:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:20:03,918 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-09-21 10:20:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:04,104 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-09-21 10:20:04,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:20:04,105 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-09-21 10:20:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:04,106 INFO L225 Difference]: With dead ends: 55 [2020-09-21 10:20:04,106 INFO L226 Difference]: Without dead ends: 51 [2020-09-21 10:20:04,107 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:20:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-09-21 10:20:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-09-21 10:20:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-09-21 10:20:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-09-21 10:20:04,114 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-09-21 10:20:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:04,114 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-09-21 10:20:04,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-21 10:20:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-09-21 10:20:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-21 10:20:04,116 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:04,116 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:20:04,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:20:04,117 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:04,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:04,117 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2020-09-21 10:20:04,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:04,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260806975] [2020-09-21 10:20:04,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,740 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:20:04,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260806975] [2020-09-21 10:20:04,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:04,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:20:04,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081615125] [2020-09-21 10:20:04,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:20:04,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:20:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:20:04,743 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-09-21 10:20:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:04,945 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-09-21 10:20:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-21 10:20:04,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-09-21 10:20:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:04,947 INFO L225 Difference]: With dead ends: 58 [2020-09-21 10:20:04,948 INFO L226 Difference]: Without dead ends: 54 [2020-09-21 10:20:04,949 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:20:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-21 10:20:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-21 10:20:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-21 10:20:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-09-21 10:20:04,956 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-09-21 10:20:04,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:04,957 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-09-21 10:20:04,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:20:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-09-21 10:20:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-21 10:20:04,958 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:04,958 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:20:04,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:20:04,959 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2020-09-21 10:20:04,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:04,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974494323] [2020-09-21 10:20:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,693 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:05,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974494323] [2020-09-21 10:20:05,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:05,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-21 10:20:05,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758694374] [2020-09-21 10:20:05,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-21 10:20:05,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:05,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-21 10:20:05,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:20:05,695 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-09-21 10:20:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:05,935 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-21 10:20:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:20:05,936 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-09-21 10:20:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:05,937 INFO L225 Difference]: With dead ends: 61 [2020-09-21 10:20:05,937 INFO L226 Difference]: Without dead ends: 57 [2020-09-21 10:20:05,938 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:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-21 10:20:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-09-21 10:20:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-21 10:20:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-09-21 10:20:05,951 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-09-21 10:20:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:05,955 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-09-21 10:20:05,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-21 10:20:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-09-21 10:20:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 10:20:05,957 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:05,958 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:05,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:20:05,958 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2020-09-21 10:20:05,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:05,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037061439] [2020-09-21 10:20:05,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,728 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:06,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1037061439] [2020-09-21 10:20:06,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:06,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-21 10:20:06,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112608042] [2020-09-21 10:20:06,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-21 10:20:06,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-21 10:20:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:20:06,731 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-09-21 10:20:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:07,018 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-21 10:20:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-21 10:20:07,019 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-09-21 10:20:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:07,021 INFO L225 Difference]: With dead ends: 64 [2020-09-21 10:20:07,021 INFO L226 Difference]: Without dead ends: 60 [2020-09-21 10:20:07,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-21 10:20:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-21 10:20:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-21 10:20:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-21 10:20:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-21 10:20:07,034 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-09-21 10:20:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:07,036 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-21 10:20:07,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-21 10:20:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-21 10:20:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-21 10:20:07,037 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:07,037 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:07,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:20:07,038 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2020-09-21 10:20:07,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:07,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089063477] [2020-09-21 10:20:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,657 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,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,806 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:07,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089063477] [2020-09-21 10:20:07,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:07,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-21 10:20:07,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517734945] [2020-09-21 10:20:07,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-21 10:20:07,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:07,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-21 10:20:07,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:20:07,812 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-09-21 10:20:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:08,132 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-09-21 10:20:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-21 10:20:08,132 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2020-09-21 10:20:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:08,133 INFO L225 Difference]: With dead ends: 67 [2020-09-21 10:20:08,135 INFO L226 Difference]: Without dead ends: 63 [2020-09-21 10:20:08,137 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:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-21 10:20:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-21 10:20:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-21 10:20:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-21 10:20:08,148 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-09-21 10:20:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:08,151 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-21 10:20:08,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-21 10:20:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-21 10:20:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-21 10:20:08,155 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:08,155 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:08,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:20:08,156 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2020-09-21 10:20:08,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:08,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779723710] [2020-09-21 10:20:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,125 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:09,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779723710] [2020-09-21 10:20:09,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:09,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-21 10:20:09,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130803240] [2020-09-21 10:20:09,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-21 10:20:09,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:09,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-21 10:20:09,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:20:09,127 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-09-21 10:20:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:09,414 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-09-21 10:20:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:20:09,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-09-21 10:20:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:09,416 INFO L225 Difference]: With dead ends: 70 [2020-09-21 10:20:09,416 INFO L226 Difference]: Without dead ends: 66 [2020-09-21 10:20:09,417 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:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-21 10:20:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-09-21 10:20:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-21 10:20:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-09-21 10:20:09,428 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-09-21 10:20:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:09,428 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-09-21 10:20:09,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-21 10:20:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-09-21 10:20:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-21 10:20:09,430 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:09,431 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:09,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-21 10:20:09,432 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:09,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:09,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2020-09-21 10:20:09,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:09,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542431447] [2020-09-21 10:20:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,388 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:10,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542431447] [2020-09-21 10:20:10,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:10,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-21 10:20:10,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890701680] [2020-09-21 10:20:10,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-21 10:20:10,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-21 10:20:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:20:10,391 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2020-09-21 10:20:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:10,708 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-09-21 10:20:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-21 10:20:10,709 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2020-09-21 10:20:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:10,710 INFO L225 Difference]: With dead ends: 73 [2020-09-21 10:20:10,710 INFO L226 Difference]: Without dead ends: 69 [2020-09-21 10:20:10,712 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-21 10:20:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-21 10:20:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-09-21 10:20:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-21 10:20:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-09-21 10:20:10,716 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-09-21 10:20:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:10,717 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-09-21 10:20:10,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-21 10:20:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-09-21 10:20:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-21 10:20:10,719 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:10,719 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:10,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-21 10:20:10,719 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2020-09-21 10:20:10,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:10,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1841703375] [2020-09-21 10:20:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:10,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:11,923 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:11,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1841703375] [2020-09-21 10:20:11,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:11,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-21 10:20:11,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432120879] [2020-09-21 10:20:11,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-21 10:20:11,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-21 10:20:11,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:20:11,929 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2020-09-21 10:20:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:12,337 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-21 10:20:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-21 10:20:12,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2020-09-21 10:20:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:12,340 INFO L225 Difference]: With dead ends: 76 [2020-09-21 10:20:12,340 INFO L226 Difference]: Without dead ends: 72 [2020-09-21 10:20:12,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-21 10:20:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-21 10:20:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-09-21 10:20:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-21 10:20:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-09-21 10:20:12,352 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-09-21 10:20:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:12,352 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-09-21 10:20:12,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-21 10:20:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-09-21 10:20:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-09-21 10:20:12,355 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:12,356 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:12,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-21 10:20:12,356 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2020-09-21 10:20:12,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:12,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255713388] [2020-09-21 10:20:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:12,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:13,819 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:13,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255713388] [2020-09-21 10:20:13,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:13,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-21 10:20:13,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949311521] [2020-09-21 10:20:13,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-21 10:20:13,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-21 10:20:13,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:20:13,822 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2020-09-21 10:20:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:14,255 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-21 10:20:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-21 10:20:14,256 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2020-09-21 10:20:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:14,258 INFO L225 Difference]: With dead ends: 79 [2020-09-21 10:20:14,258 INFO L226 Difference]: Without dead ends: 75 [2020-09-21 10:20:14,261 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:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-21 10:20:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-21 10:20:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-21 10:20:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-21 10:20:14,275 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-09-21 10:20:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:14,276 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-21 10:20:14,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-21 10:20:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-21 10:20:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-21 10:20:14,279 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:14,279 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:14,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-21 10:20:14,279 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:14,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:14,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2020-09-21 10:20:14,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:14,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791693026] [2020-09-21 10:20:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:14,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-09-21 10:20:15,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791693026] [2020-09-21 10:20:15,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:15,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-21 10:20:15,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096125682] [2020-09-21 10:20:15,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-21 10:20:15,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-21 10:20:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:20:15,642 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 25 states. [2020-09-21 10:20:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:15,979 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2020-09-21 10:20:15,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-21 10:20:15,979 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2020-09-21 10:20:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:15,980 INFO L225 Difference]: With dead ends: 82 [2020-09-21 10:20:15,980 INFO L226 Difference]: Without dead ends: 78 [2020-09-21 10:20:15,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2020-09-21 10:20:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-21 10:20:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-21 10:20:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-21 10:20:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-21 10:20:15,986 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 133 [2020-09-21 10:20:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:15,988 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-21 10:20:15,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-21 10:20:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-21 10:20:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-09-21 10:20:15,990 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:15,990 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:15,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-21 10:20:15,991 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1648275844, now seen corresponding path program 21 times [2020-09-21 10:20:15,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:15,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255797529] [2020-09-21 10:20:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:16,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-09-21 10:20:17,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255797529] [2020-09-21 10:20:17,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:17,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-09-21 10:20:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123043587] [2020-09-21 10:20:17,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-21 10:20:17,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-21 10:20:17,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:20:17,312 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 26 states. [2020-09-21 10:20:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:17,649 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2020-09-21 10:20:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-21 10:20:17,651 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2020-09-21 10:20:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:17,652 INFO L225 Difference]: With dead ends: 85 [2020-09-21 10:20:17,652 INFO L226 Difference]: Without dead ends: 81 [2020-09-21 10:20:17,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2020-09-21 10:20:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-21 10:20:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-09-21 10:20:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-21 10:20:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2020-09-21 10:20:17,665 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 139 [2020-09-21 10:20:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:17,666 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2020-09-21 10:20:17,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-21 10:20:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2020-09-21 10:20:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-21 10:20:17,667 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:17,668 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:17,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-21 10:20:17,668 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1314278308, now seen corresponding path program 22 times [2020-09-21 10:20:17,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:17,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042660868] [2020-09-21 10:20:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:17,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:18,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-09-21 10:20:19,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042660868] [2020-09-21 10:20:19,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:19,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-21 10:20:19,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891880256] [2020-09-21 10:20:19,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-21 10:20:19,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-21 10:20:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:20:19,188 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 27 states. [2020-09-21 10:20:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:19,632 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2020-09-21 10:20:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-21 10:20:19,633 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2020-09-21 10:20:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:19,634 INFO L225 Difference]: With dead ends: 88 [2020-09-21 10:20:19,634 INFO L226 Difference]: Without dead ends: 84 [2020-09-21 10:20:19,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2020-09-21 10:20:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-09-21 10:20:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-09-21 10:20:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-09-21 10:20:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-09-21 10:20:19,641 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 145 [2020-09-21 10:20:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:19,641 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-09-21 10:20:19,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-21 10:20:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-09-21 10:20:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-09-21 10:20:19,643 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:19,643 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:19,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-21 10:20:19,644 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2015638980, now seen corresponding path program 23 times [2020-09-21 10:20:19,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:19,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132544567] [2020-09-21 10:20:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:19,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:20,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-09-21 10:20:21,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132544567] [2020-09-21 10:20:21,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:21,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-09-21 10:20:21,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785952253] [2020-09-21 10:20:21,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-21 10:20:21,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:21,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-21 10:20:21,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:20:21,178 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 28 states. [2020-09-21 10:20:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:21,699 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-21 10:20:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-21 10:20:21,700 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2020-09-21 10:20:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:21,702 INFO L225 Difference]: With dead ends: 91 [2020-09-21 10:20:21,702 INFO L226 Difference]: Without dead ends: 87 [2020-09-21 10:20:21,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-09-21 10:20:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-09-21 10:20:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-09-21 10:20:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-21 10:20:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-09-21 10:20:21,709 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 151 [2020-09-21 10:20:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:21,709 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-09-21 10:20:21,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-21 10:20:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-09-21 10:20:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-21 10:20:21,710 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:21,711 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:21,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-21 10:20:21,711 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:21,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash 483163804, now seen corresponding path program 24 times [2020-09-21 10:20:21,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:21,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141774335] [2020-09-21 10:20:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:21,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:22,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:23,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:23,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:23,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-09-21 10:20:23,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141774335] [2020-09-21 10:20:23,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:23,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-09-21 10:20:23,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912977167] [2020-09-21 10:20:23,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-21 10:20:23,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-21 10:20:23,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-09-21 10:20:23,312 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 29 states. [2020-09-21 10:20:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:23,842 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-21 10:20:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-21 10:20:23,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2020-09-21 10:20:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:23,845 INFO L225 Difference]: With dead ends: 94 [2020-09-21 10:20:23,846 INFO L226 Difference]: Without dead ends: 90 [2020-09-21 10:20:23,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-09-21 10:20:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-21 10:20:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-21 10:20:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-21 10:20:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-21 10:20:23,852 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 157 [2020-09-21 10:20:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:23,853 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-21 10:20:23,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-21 10:20:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-21 10:20:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-21 10:20:23,854 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:23,854 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:23,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-21 10:20:23,855 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1060706820, now seen corresponding path program 25 times [2020-09-21 10:20:23,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:23,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [233105755] [2020-09-21 10:20:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:20:23,897 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:20:23,897 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:20:23,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-21 10:20:23,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:20:23 BoogieIcfgContainer [2020-09-21 10:20:23,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:20:23,943 INFO L168 Benchmark]: Toolchain (without parser) took 26188.33 ms. Allocated memory was 147.3 MB in the beginning and 649.1 MB in the end (delta: 501.7 MB). Free memory was 104.1 MB in the beginning and 471.1 MB in the end (delta: -367.1 MB). Peak memory consumption was 134.7 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:23,944 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-21 10:20:23,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.42 ms. Allocated memory is still 147.3 MB. Free memory was 103.2 MB in the beginning and 94.1 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:23,945 INFO L168 Benchmark]: Boogie Preprocessor took 36.75 ms. Allocated memory is still 147.3 MB. Free memory was 94.1 MB in the beginning and 92.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:23,945 INFO L168 Benchmark]: RCFGBuilder took 365.22 ms. Allocated memory was 147.3 MB in the beginning and 202.9 MB in the end (delta: 55.6 MB). Free memory was 92.8 MB in the beginning and 170.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:23,946 INFO L168 Benchmark]: TraceAbstraction took 25475.05 ms. Allocated memory was 202.9 MB in the beginning and 649.1 MB in the end (delta: 446.2 MB). Free memory was 170.7 MB in the beginning and 471.1 MB in the end (delta: -300.4 MB). Peak memory consumption was 145.8 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:23,948 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.24 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 300.42 ms. Allocated memory is still 147.3 MB. Free memory was 103.2 MB in the beginning and 94.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.75 ms. Allocated memory is still 147.3 MB. Free memory was 94.1 MB in the beginning and 92.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 365.22 ms. Allocated memory was 147.3 MB in the beginning and 202.9 MB in the end (delta: 55.6 MB). Free memory was 92.8 MB in the beginning and 170.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25475.05 ms. Allocated memory was 202.9 MB in the beginning and 649.1 MB in the end (delta: 446.2 MB). Free memory was 170.7 MB in the beginning and 471.1 MB in the end (delta: -300.4 MB). Peak memory consumption was 145.8 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 = 25; [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 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); [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: 25.3s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 303 SDtfs, 778 SDslu, 1572 SDs, 0 SdLazy, 1115 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1425 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 2288 NumberOfCodeBlocks, 2288 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2100 ConstructedInterpolants, 0 QuantifiedInterpolants, 570000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 7500/15000 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...