/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:49:52,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:49:52,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:49:52,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:49:52,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:49:52,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:49:52,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:49:52,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:49:52,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:49:52,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:49:52,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:49:52,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:49:52,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:49:52,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:49:52,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:49:52,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:49:52,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:49:52,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:49:52,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:49:52,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:49:52,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:49:52,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:49:52,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:49:52,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:49:52,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:49:52,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:49:52,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:49:52,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:49:52,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:49:52,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:49:52,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:49:52,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:49:52,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:49:52,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:49:52,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:49:52,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:49:52,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:49:52,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:49:52,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:49:52,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:49:52,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:49:52,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:49:52,243 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:49:52,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:49:52,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:49:52,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:49:52,245 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:49:52,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:49:52,246 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:49:52,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:49:52,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:49:52,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:49:52,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:49:52,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:49:52,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:49:52,247 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:49:52,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:49:52,248 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:49:52,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:49:52,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:49:52,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:49:52,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:49:52,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:49:52,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:52,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:49:52,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:49:52,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:49:52,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:49:52,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:49:52,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:49:52,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:49:52,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-27 21:49:52,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:49:52,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:49:52,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:49:52,821 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:49:52,821 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:49:52,822 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-08-27 21:49:52,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72cd548e1/d4956281963b4c37a7fcc7bbd1e6e843/FLAG53fc92c45 [2020-08-27 21:49:53,472 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:49:53,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-08-27 21:49:53,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72cd548e1/d4956281963b4c37a7fcc7bbd1e6e843/FLAG53fc92c45 [2020-08-27 21:49:53,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72cd548e1/d4956281963b4c37a7fcc7bbd1e6e843 [2020-08-27 21:49:53,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:49:53,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:49:53,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:53,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:49:53,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:49:53,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab41b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53, skipping insertion in model container [2020-08-27 21:49:53,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:49:53,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:49:54,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:54,087 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:49:54,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:54,125 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:49:54,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54 WrapperNode [2020-08-27 21:49:54,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:54,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:49:54,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:49:54,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:49:54,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... [2020-08-27 21:49:54,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... [2020-08-27 21:49:54,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... [2020-08-27 21:49:54,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... [2020-08-27 21:49:54,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... [2020-08-27 21:49:54,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... [2020-08-27 21:49:54,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... [2020-08-27 21:49:54,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:49:54,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:49:54,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:49:54,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:49:54,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:54,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:49:54,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:49:54,323 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-27 21:49:54,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:49:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:49:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:49:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-27 21:49:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:49:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:49:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:49:54,514 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:49:54,514 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:49:54,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:54 BoogieIcfgContainer [2020-08-27 21:49:54,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:49:54,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:49:54,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:49:54,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:49:54,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:49:53" (1/3) ... [2020-08-27 21:49:54,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e01822e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:54, skipping insertion in model container [2020-08-27 21:49:54,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:54" (2/3) ... [2020-08-27 21:49:54,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e01822e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:54, skipping insertion in model container [2020-08-27 21:49:54,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:54" (3/3) ... [2020-08-27 21:49:54,529 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2020-08-27 21:49:54,542 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:49:54,552 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:49:54,575 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:49:54,608 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:49:54,608 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:49:54,609 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:49:54,609 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:49:54,609 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:49:54,609 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:49:54,609 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:49:54,609 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:49:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-27 21:49:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-27 21:49:54,642 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,644 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-08-27 21:49:54,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978304749] [2020-08-27 21:49:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:49:54,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978304749] [2020-08-27 21:49:54,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:49:54,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:49:54,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148848769] [2020-08-27 21:49:54,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:49:54,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:49:55,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:49:55,023 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-27 21:49:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,109 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-27 21:49:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:49:55,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-27 21:49:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,123 INFO L225 Difference]: With dead ends: 30 [2020-08-27 21:49:55,124 INFO L226 Difference]: Without dead ends: 18 [2020-08-27 21:49:55,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-27 21:49:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-27 21:49:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-27 21:49:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-27 21:49:55,186 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-27 21:49:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,187 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-27 21:49:55,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:49:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-27 21:49:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-27 21:49:55,190 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,191 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:49:55,191 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-08-27 21:49:55,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [230722057] [2020-08-27 21:49:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-27 21:49:55,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [230722057] [2020-08-27 21:49:55,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:49:55,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773914167] [2020-08-27 21:49:55,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:49:55,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:49:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:55,399 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-27 21:49:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,480 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-27 21:49:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:49:55,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-27 21:49:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,483 INFO L225 Difference]: With dead ends: 25 [2020-08-27 21:49:55,483 INFO L226 Difference]: Without dead ends: 21 [2020-08-27 21:49:55,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-27 21:49:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-27 21:49:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-27 21:49:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-27 21:49:55,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-27 21:49:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,501 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-27 21:49:55,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:49:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-27 21:49:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-27 21:49:55,504 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,505 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:49:55,506 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-08-27 21:49:55,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1655061694] [2020-08-27 21:49:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-27 21:49:55,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1655061694] [2020-08-27 21:49:55,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:55,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396175001] [2020-08-27 21:49:55,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:55,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:55,734 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-27 21:49:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,800 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-27 21:49:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:49:55,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-27 21:49:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,802 INFO L225 Difference]: With dead ends: 28 [2020-08-27 21:49:55,803 INFO L226 Difference]: Without dead ends: 24 [2020-08-27 21:49:55,804 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-08-27 21:49:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-27 21:49:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-27 21:49:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-27 21:49:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-27 21:49:55,811 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-27 21:49:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,811 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-27 21:49:55,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-27 21:49:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-27 21:49:55,813 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,813 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:49:55,813 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-08-27 21:49:55,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [889822329] [2020-08-27 21:49:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-27 21:49:56,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [889822329] [2020-08-27 21:49:56,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:56,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318820693] [2020-08-27 21:49:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:56,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:56,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:56,071 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-27 21:49:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,186 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-27 21:49:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:49:56,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-27 21:49:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,189 INFO L225 Difference]: With dead ends: 31 [2020-08-27 21:49:56,189 INFO L226 Difference]: Without dead ends: 27 [2020-08-27 21:49:56,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-27 21:49:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-27 21:49:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-27 21:49:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-27 21:49:56,197 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-27 21:49:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,197 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-27 21:49:56,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-27 21:49:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-27 21:49:56,199 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,199 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:56,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:49:56,200 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-08-27 21:49:56,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399967637] [2020-08-27 21:49:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-27 21:49:56,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399967637] [2020-08-27 21:49:56,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:49:56,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787759034] [2020-08-27 21:49:56,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:49:56,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:49:56,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:49:56,431 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-27 21:49:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,544 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-27 21:49:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:56,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-27 21:49:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,546 INFO L225 Difference]: With dead ends: 34 [2020-08-27 21:49:56,546 INFO L226 Difference]: Without dead ends: 30 [2020-08-27 21:49:56,547 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-08-27 21:49:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-27 21:49:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-27 21:49:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-27 21:49:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-27 21:49:56,555 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-27 21:49:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,555 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-27 21:49:56,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:49:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-27 21:49:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-27 21:49:56,557 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,557 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:56,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:49:56,558 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-08-27 21:49:56,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1557812095] [2020-08-27 21:49:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-27 21:49:56,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1557812095] [2020-08-27 21:49:56,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:56,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245957170] [2020-08-27 21:49:56,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:56,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:56,753 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-27 21:49:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,860 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-27 21:49:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:49:56,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-27 21:49:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,862 INFO L225 Difference]: With dead ends: 37 [2020-08-27 21:49:56,862 INFO L226 Difference]: Without dead ends: 33 [2020-08-27 21:49:56,863 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-08-27 21:49:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-27 21:49:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-27 21:49:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-27 21:49:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-27 21:49:56,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-27 21:49:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,870 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-27 21:49:56,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-27 21:49:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-27 21:49:56,876 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,876 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:56,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:49:56,876 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-08-27 21:49:56,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878922592] [2020-08-27 21:49:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-27 21:49:57,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878922592] [2020-08-27 21:49:57,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-27 21:49:57,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660885757] [2020-08-27 21:49:57,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:49:57,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:49:57,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:49:57,150 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-27 21:49:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,287 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-27 21:49:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:49:57,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-27 21:49:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,289 INFO L225 Difference]: With dead ends: 40 [2020-08-27 21:49:57,289 INFO L226 Difference]: Without dead ends: 36 [2020-08-27 21:49:57,290 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-08-27 21:49:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-27 21:49:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-27 21:49:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-27 21:49:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-27 21:49:57,297 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-27 21:49:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,298 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-27 21:49:57,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:49:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-27 21:49:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-27 21:49:57,299 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,300 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:57,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:49:57,300 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-08-27 21:49:57,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120502507] [2020-08-27 21:49:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-27 21:49:57,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120502507] [2020-08-27 21:49:57,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-27 21:49:57,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390440618] [2020-08-27 21:49:57,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:49:57,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:49:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:57,611 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-27 21:49:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,750 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-27 21:49:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:49:57,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-27 21:49:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,752 INFO L225 Difference]: With dead ends: 43 [2020-08-27 21:49:57,753 INFO L226 Difference]: Without dead ends: 39 [2020-08-27 21:49:57,754 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-08-27 21:49:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-27 21:49:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-27 21:49:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-27 21:49:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-27 21:49:57,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-27 21:49:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,761 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-27 21:49:57,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:49:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-27 21:49:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-27 21:49:57,763 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,763 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:57,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:49:57,764 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-08-27 21:49:57,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99665999] [2020-08-27 21:49:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-27 21:49:58,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99665999] [2020-08-27 21:49:58,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:58,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-27 21:49:58,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607275486] [2020-08-27 21:49:58,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-27 21:49:58,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-27 21:49:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:49:58,083 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-27 21:49:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:58,228 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-27 21:49:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-27 21:49:58,229 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-27 21:49:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:58,230 INFO L225 Difference]: With dead ends: 46 [2020-08-27 21:49:58,230 INFO L226 Difference]: Without dead ends: 42 [2020-08-27 21:49:58,231 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-08-27 21:49:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-27 21:49:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-27 21:49:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-27 21:49:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-27 21:49:58,238 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-27 21:49:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:58,239 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-27 21:49:58,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-27 21:49:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-27 21:49:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-27 21:49:58,240 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:58,240 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:58,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:49:58,241 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-08-27 21:49:58,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:58,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1961143112] [2020-08-27 21:49:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-27 21:49:58,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1961143112] [2020-08-27 21:49:58,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:58,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-27 21:49:58,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159155598] [2020-08-27 21:49:58,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-27 21:49:58,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:58,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-27 21:49:58,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:58,581 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-27 21:49:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:58,755 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-27 21:49:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-27 21:49:58,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-27 21:49:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:58,758 INFO L225 Difference]: With dead ends: 49 [2020-08-27 21:49:58,758 INFO L226 Difference]: Without dead ends: 45 [2020-08-27 21:49:58,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-08-27 21:49:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-27 21:49:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-27 21:49:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-27 21:49:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-27 21:49:58,765 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-27 21:49:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:58,766 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-27 21:49:58,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-27 21:49:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-27 21:49:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-27 21:49:58,767 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:58,768 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:58,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:49:58,768 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-08-27 21:49:58,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:58,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520083800] [2020-08-27 21:49:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-27 21:49:59,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520083800] [2020-08-27 21:49:59,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:59,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-27 21:49:59,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256594758] [2020-08-27 21:49:59,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-27 21:49:59,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-27 21:49:59,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-08-27 21:49:59,262 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-08-27 21:49:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:59,446 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-27 21:49:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-27 21:49:59,447 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-08-27 21:49:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:59,449 INFO L225 Difference]: With dead ends: 52 [2020-08-27 21:49:59,449 INFO L226 Difference]: Without dead ends: 48 [2020-08-27 21:49:59,450 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-08-27 21:49:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-27 21:49:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-27 21:49:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-27 21:49:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-27 21:49:59,466 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-27 21:49:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:59,466 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-27 21:49:59,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-27 21:49:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-27 21:49:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-27 21:49:59,470 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:59,470 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:59,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:49:59,471 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-08-27 21:49:59,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:59,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922066123] [2020-08-27 21:49:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-27 21:50:00,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922066123] [2020-08-27 21:50:00,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:00,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-27 21:50:00,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293346325] [2020-08-27 21:50:00,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-27 21:50:00,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-27 21:50:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:50:00,039 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-27 21:50:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:00,288 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-27 21:50:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-27 21:50:00,289 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-27 21:50:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:00,290 INFO L225 Difference]: With dead ends: 55 [2020-08-27 21:50:00,290 INFO L226 Difference]: Without dead ends: 51 [2020-08-27 21:50:00,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-08-27 21:50:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-27 21:50:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-27 21:50:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-27 21:50:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-27 21:50:00,303 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-27 21:50:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:00,303 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-27 21:50:00,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-27 21:50:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-27 21:50:00,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-27 21:50:00,306 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:00,306 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:00,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:50:00,306 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:00,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-08-27 21:50:00,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:00,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1250034646] [2020-08-27 21:50:00,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-27 21:50:00,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1250034646] [2020-08-27 21:50:00,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:00,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-27 21:50:00,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664560353] [2020-08-27 21:50:00,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-27 21:50:00,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:00,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-27 21:50:00,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-08-27 21:50:00,863 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-08-27 21:50:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:01,155 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-27 21:50:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-27 21:50:01,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-08-27 21:50:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:01,156 INFO L225 Difference]: With dead ends: 58 [2020-08-27 21:50:01,157 INFO L226 Difference]: Without dead ends: 54 [2020-08-27 21:50:01,159 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-08-27 21:50:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-27 21:50:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-27 21:50:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-27 21:50:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-27 21:50:01,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-27 21:50:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:01,170 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-27 21:50:01,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-27 21:50:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-27 21:50:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-27 21:50:01,174 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:01,174 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:01,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:50:01,174 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-08-27 21:50:01,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:01,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1786263236] [2020-08-27 21:50:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-27 21:50:01,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1786263236] [2020-08-27 21:50:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:01,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-27 21:50:01,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191803869] [2020-08-27 21:50:01,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-27 21:50:01,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-27 21:50:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:50:01,809 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-08-27 21:50:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:02,054 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-27 21:50:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-27 21:50:02,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-08-27 21:50:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:02,057 INFO L225 Difference]: With dead ends: 61 [2020-08-27 21:50:02,057 INFO L226 Difference]: Without dead ends: 57 [2020-08-27 21:50:02,059 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-08-27 21:50:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-27 21:50:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-27 21:50:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-27 21:50:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-27 21:50:02,070 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-27 21:50:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:02,071 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-27 21:50:02,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-27 21:50:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-27 21:50:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-27 21:50:02,072 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:02,072 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:02,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-27 21:50:02,073 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-08-27 21:50:02,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:02,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167718862] [2020-08-27 21:50:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-27 21:50:02,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167718862] [2020-08-27 21:50:02,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:02,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-27 21:50:02,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222271494] [2020-08-27 21:50:02,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-27 21:50:02,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:02,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-27 21:50:02,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-08-27 21:50:02,752 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-08-27 21:50:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:03,068 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-27 21:50:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-27 21:50:03,070 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-08-27 21:50:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:03,071 INFO L225 Difference]: With dead ends: 64 [2020-08-27 21:50:03,071 INFO L226 Difference]: Without dead ends: 60 [2020-08-27 21:50:03,072 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-08-27 21:50:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-27 21:50:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-27 21:50:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-27 21:50:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-27 21:50:03,087 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-27 21:50:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:03,087 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-27 21:50:03,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-27 21:50:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-27 21:50:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-27 21:50:03,090 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:03,091 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:03,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-27 21:50:03,091 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:03,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-08-27 21:50:03,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:03,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554365869] [2020-08-27 21:50:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-08-27 21:50:03,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554365869] [2020-08-27 21:50:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-27 21:50:03,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051491648] [2020-08-27 21:50:03,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-27 21:50:03,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-27 21:50:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-08-27 21:50:03,888 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-08-27 21:50:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:04,220 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-27 21:50:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-27 21:50:04,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2020-08-27 21:50:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:04,222 INFO L225 Difference]: With dead ends: 67 [2020-08-27 21:50:04,223 INFO L226 Difference]: Without dead ends: 63 [2020-08-27 21:50:04,227 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-08-27 21:50:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-27 21:50:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-27 21:50:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-27 21:50:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-27 21:50:04,238 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-27 21:50:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:04,239 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-27 21:50:04,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-27 21:50:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-27 21:50:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-27 21:50:04,241 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:04,241 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:04,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-27 21:50:04,241 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2020-08-27 21:50:04,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:04,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [679680729] [2020-08-27 21:50:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-27 21:50:05,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [679680729] [2020-08-27 21:50:05,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:05,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-27 21:50:05,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355291233] [2020-08-27 21:50:05,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-27 21:50:05,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-27 21:50:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:50:05,155 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-08-27 21:50:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:05,431 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-08-27 21:50:05,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-27 21:50:05,432 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-08-27 21:50:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:05,433 INFO L225 Difference]: With dead ends: 70 [2020-08-27 21:50:05,433 INFO L226 Difference]: Without dead ends: 66 [2020-08-27 21:50:05,435 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-08-27 21:50:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-27 21:50:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-27 21:50:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-27 21:50:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-08-27 21:50:05,440 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-08-27 21:50:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:05,440 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-08-27 21:50:05,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-27 21:50:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-08-27 21:50:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-27 21:50:05,442 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:05,442 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:05,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-27 21:50:05,442 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:05,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:05,443 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2020-08-27 21:50:05,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:05,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1876442649] [2020-08-27 21:50:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-08-27 21:50:06,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1876442649] [2020-08-27 21:50:06,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:06,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-08-27 21:50:06,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24652436] [2020-08-27 21:50:06,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-27 21:50:06,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-27 21:50:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-08-27 21:50:06,408 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2020-08-27 21:50:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:06,880 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-08-27 21:50:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-27 21:50:06,880 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2020-08-27 21:50:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:06,881 INFO L225 Difference]: With dead ends: 73 [2020-08-27 21:50:06,881 INFO L226 Difference]: Without dead ends: 69 [2020-08-27 21:50:06,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-08-27 21:50:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-27 21:50:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-27 21:50:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-27 21:50:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-08-27 21:50:06,894 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-08-27 21:50:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:06,895 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-08-27 21:50:06,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-27 21:50:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-08-27 21:50:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-27 21:50:06,897 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:06,897 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:06,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-27 21:50:06,897 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2020-08-27 21:50:06,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:06,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1895783558] [2020-08-27 21:50:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-08-27 21:50:07,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1895783558] [2020-08-27 21:50:07,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:07,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-27 21:50:07,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919357861] [2020-08-27 21:50:07,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-27 21:50:07,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:07,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-27 21:50:07,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-08-27 21:50:07,953 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2020-08-27 21:50:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:08,278 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-08-27 21:50:08,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-27 21:50:08,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2020-08-27 21:50:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:08,281 INFO L225 Difference]: With dead ends: 76 [2020-08-27 21:50:08,281 INFO L226 Difference]: Without dead ends: 72 [2020-08-27 21:50:08,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-08-27 21:50:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-08-27 21:50:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-08-27 21:50:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-27 21:50:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-08-27 21:50:08,289 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-08-27 21:50:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:08,289 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-08-27 21:50:08,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-27 21:50:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-08-27 21:50:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-27 21:50:08,292 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:08,292 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:08,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-27 21:50:08,292 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2020-08-27 21:50:08,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:08,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779980894] [2020-08-27 21:50:08,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-08-27 21:50:09,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779980894] [2020-08-27 21:50:09,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:09,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-08-27 21:50:09,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296911155] [2020-08-27 21:50:09,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-08-27 21:50:09,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-08-27 21:50:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-08-27 21:50:09,382 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2020-08-27 21:50:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:09,738 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-08-27 21:50:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-27 21:50:09,739 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2020-08-27 21:50:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:09,741 INFO L225 Difference]: With dead ends: 79 [2020-08-27 21:50:09,741 INFO L226 Difference]: Without dead ends: 75 [2020-08-27 21:50:09,743 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-08-27 21:50:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-27 21:50:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-08-27 21:50:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-08-27 21:50:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-08-27 21:50:09,748 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-08-27 21:50:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:09,749 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-08-27 21:50:09,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-08-27 21:50:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-08-27 21:50:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-27 21:50:09,750 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:09,750 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:09,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-27 21:50:09,751 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2020-08-27 21:50:09,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:09,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [40153173] [2020-08-27 21:50:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:09,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-08-27 21:50:10,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [40153173] [2020-08-27 21:50:10,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:10,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-08-27 21:50:10,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885023403] [2020-08-27 21:50:10,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-08-27 21:50:10,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-08-27 21:50:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-08-27 21:50:10,959 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 25 states. [2020-08-27 21:50:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:11,323 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2020-08-27 21:50:11,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-08-27 21:50:11,325 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2020-08-27 21:50:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:11,326 INFO L225 Difference]: With dead ends: 82 [2020-08-27 21:50:11,326 INFO L226 Difference]: Without dead ends: 78 [2020-08-27 21:50:11,328 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-08-27 21:50:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-27 21:50:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-08-27 21:50:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-08-27 21:50:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-08-27 21:50:11,336 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 133 [2020-08-27 21:50:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:11,338 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-08-27 21:50:11,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-08-27 21:50:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-08-27 21:50:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-08-27 21:50:11,342 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:11,342 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:11,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-27 21:50:11,343 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1226192145, now seen corresponding path program 21 times [2020-08-27 21:50:11,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:11,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516047840] [2020-08-27 21:50:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:11,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-08-27 21:50:12,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516047840] [2020-08-27 21:50:12,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:12,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-08-27 21:50:12,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334204561] [2020-08-27 21:50:12,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-08-27 21:50:12,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-08-27 21:50:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-08-27 21:50:12,626 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 26 states. [2020-08-27 21:50:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:13,115 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2020-08-27 21:50:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-27 21:50:13,118 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2020-08-27 21:50:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:13,119 INFO L225 Difference]: With dead ends: 85 [2020-08-27 21:50:13,119 INFO L226 Difference]: Without dead ends: 81 [2020-08-27 21:50:13,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2020-08-27 21:50:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-08-27 21:50:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-08-27 21:50:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-08-27 21:50:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2020-08-27 21:50:13,127 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 139 [2020-08-27 21:50:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:13,127 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2020-08-27 21:50:13,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-08-27 21:50:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2020-08-27 21:50:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-27 21:50:13,132 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:13,132 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:13,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-08-27 21:50:13,132 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1155535485, now seen corresponding path program 22 times [2020-08-27 21:50:13,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:13,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [17079460] [2020-08-27 21:50:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:13,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-08-27 21:50:14,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [17079460] [2020-08-27 21:50:14,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:14,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-08-27 21:50:14,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967671398] [2020-08-27 21:50:14,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-08-27 21:50:14,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-08-27 21:50:14,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-08-27 21:50:14,385 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 27 states. [2020-08-27 21:50:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:14,854 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2020-08-27 21:50:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-27 21:50:14,855 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2020-08-27 21:50:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:14,857 INFO L225 Difference]: With dead ends: 88 [2020-08-27 21:50:14,857 INFO L226 Difference]: Without dead ends: 84 [2020-08-27 21:50:14,858 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-08-27 21:50:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-08-27 21:50:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-08-27 21:50:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-08-27 21:50:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-08-27 21:50:14,863 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 145 [2020-08-27 21:50:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:14,863 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-08-27 21:50:14,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-08-27 21:50:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-08-27 21:50:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-08-27 21:50:14,865 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:14,865 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:14,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-08-27 21:50:14,866 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash 478692079, now seen corresponding path program 23 times [2020-08-27 21:50:14,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:14,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971248170] [2020-08-27 21:50:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:14,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:15,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-08-27 21:50:16,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971248170] [2020-08-27 21:50:16,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:16,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-08-27 21:50:16,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771243376] [2020-08-27 21:50:16,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-08-27 21:50:16,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-08-27 21:50:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-08-27 21:50:16,272 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 28 states. [2020-08-27 21:50:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:16,800 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-08-27 21:50:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-08-27 21:50:16,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2020-08-27 21:50:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:16,804 INFO L225 Difference]: With dead ends: 91 [2020-08-27 21:50:16,805 INFO L226 Difference]: Without dead ends: 87 [2020-08-27 21:50:16,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-08-27 21:50:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-08-27 21:50:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-08-27 21:50:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-27 21:50:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-08-27 21:50:16,814 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 151 [2020-08-27 21:50:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:16,814 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-08-27 21:50:16,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-08-27 21:50:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-08-27 21:50:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-08-27 21:50:16,816 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:16,817 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:16,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-08-27 21:50:16,817 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash -414572547, now seen corresponding path program 24 times [2020-08-27 21:50:16,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:16,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542206619] [2020-08-27 21:50:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:16,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:17,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:18,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:18,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-08-27 21:50:18,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542206619] [2020-08-27 21:50:18,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:18,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-08-27 21:50:18,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180793090] [2020-08-27 21:50:18,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-08-27 21:50:18,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-08-27 21:50:18,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-08-27 21:50:18,233 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 29 states. [2020-08-27 21:50:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:18,774 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-08-27 21:50:18,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-27 21:50:18,775 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2020-08-27 21:50:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:18,776 INFO L225 Difference]: With dead ends: 94 [2020-08-27 21:50:18,776 INFO L226 Difference]: Without dead ends: 90 [2020-08-27 21:50:18,778 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-08-27 21:50:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-08-27 21:50:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-08-27 21:50:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-08-27 21:50:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-08-27 21:50:18,782 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 157 [2020-08-27 21:50:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:18,782 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-08-27 21:50:18,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-08-27 21:50:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-08-27 21:50:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-08-27 21:50:18,784 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:18,784 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:18,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-08-27 21:50:18,784 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash -975000849, now seen corresponding path program 25 times [2020-08-27 21:50:18,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:18,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2008140193] [2020-08-27 21:50:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-27 21:50:18,816 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-27 21:50:18,817 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-27 21:50:18,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-08-27 21:50:18,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:50:18 BoogieIcfgContainer [2020-08-27 21:50:18,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:50:18,853 INFO L168 Benchmark]: Toolchain (without parser) took 25020.14 ms. Allocated memory was 138.4 MB in the beginning and 650.1 MB in the end (delta: 511.7 MB). Free memory was 101.3 MB in the beginning and 503.9 MB in the end (delta: -402.6 MB). Peak memory consumption was 109.1 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:18,854 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-27 21:50:18,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.96 ms. Allocated memory is still 138.4 MB. Free memory was 100.9 MB in the beginning and 91.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:18,855 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 ms. Allocated memory is still 138.4 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:18,855 INFO L168 Benchmark]: RCFGBuilder took 357.42 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 90.3 MB in the beginning and 168.9 MB in the end (delta: -78.6 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:18,856 INFO L168 Benchmark]: TraceAbstraction took 24329.91 ms. Allocated memory was 200.8 MB in the beginning and 650.1 MB in the end (delta: 449.3 MB). Free memory was 168.9 MB in the beginning and 503.9 MB in the end (delta: -335.0 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:18,858 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.96 ms. Allocated memory is still 138.4 MB. Free memory was 100.9 MB in the beginning and 91.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.23 ms. Allocated memory is still 138.4 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 357.42 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 90.3 MB in the beginning and 168.9 MB in the end (delta: -78.6 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24329.91 ms. Allocated memory was 200.8 MB in the beginning and 650.1 MB in the end (delta: 449.3 MB). Free memory was 168.9 MB in the beginning and 503.9 MB in the end (delta: -335.0 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 25; [L11] CALL, EXPR id(input) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND TRUE x==0 [L5] return 0; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 25 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.2s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 329 SDtfs, 778 SDslu, 1676 SDs, 0 SdLazy, 985 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, 10.3s 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.3s SatisfiabilityAnalysisTime, 16.0s 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...