/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_i15_o15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:49:50,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:49:50,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:49:50,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:49:50,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:49:50,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:49:50,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:49:50,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:49:50,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:49:50,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:49:50,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:49:50,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:49:50,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:49:50,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:49:50,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:49:50,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:49:50,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:49:50,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:49:50,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:49:50,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:49:50,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:49:50,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:49:50,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:49:50,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:49:50,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:49:50,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:49:50,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:49:50,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:49:50,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:49:50,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:49:50,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:49:50,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:49:50,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:49:50,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:49:50,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:49:50,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:49:50,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:49:50,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:49:50,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:49:50,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:49:50,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:49:50,799 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:50,842 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:49:50,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:49:50,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:49:50,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:49:50,845 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:49:50,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:49:50,845 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:49:50,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:49:50,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:49:50,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:49:50,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:49:50,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:49:50,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:49:50,848 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:49:50,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:49:50,848 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:49:50,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:49:50,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:49:50,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:49:50,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:49:50,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:49:50,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:50,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:49:50,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:49:50,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:49:50,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:49:50,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:49:50,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:49:50,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:49:50,851 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:51,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:49:51,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:49:51,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:49:51,362 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:49:51,362 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:49:51,364 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c [2020-08-27 21:49:51,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/21104ab24/3c98c6eda2b44cf9a44a29a48967e0a8/FLAGeae5a890b [2020-08-27 21:49:51,992 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:49:51,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c [2020-08-27 21:49:52,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/21104ab24/3c98c6eda2b44cf9a44a29a48967e0a8/FLAGeae5a890b [2020-08-27 21:49:52,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/21104ab24/3c98c6eda2b44cf9a44a29a48967e0a8 [2020-08-27 21:49:52,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:49:52,350 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:49:52,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:52,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:49:52,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:49:52,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:52" (1/1) ... [2020-08-27 21:49:52,364 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:52, skipping insertion in model container [2020-08-27 21:49:52,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:52" (1/1) ... [2020-08-27 21:49:52,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:49:52,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:49:52,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:52,605 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:49:52,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:52,636 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:49:52,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:52 WrapperNode [2020-08-27 21:49:52,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:52,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:49:52,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:49:52,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:49:52,652 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:52" (1/1) ... [2020-08-27 21:49:52,652 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:52" (1/1) ... [2020-08-27 21:49:52,658 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:52" (1/1) ... [2020-08-27 21:49:52,658 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:52" (1/1) ... [2020-08-27 21:49:52,662 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:52" (1/1) ... [2020-08-27 21:49:52,665 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:52" (1/1) ... [2020-08-27 21:49:52,666 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:52" (1/1) ... [2020-08-27 21:49:52,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:49:52,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:49:52,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:49:52,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:49:52,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:52,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:49:52,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:49:52,842 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-27 21:49:52,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:49:52,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:49:52,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:49:52,843 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-27 21:49:52,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:49:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:49:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:49:53,026 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:49:53,027 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:49:53,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:53 BoogieIcfgContainer [2020-08-27 21:49:53,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:49:53,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:49:53,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:49:53,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:49:53,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:49:52" (1/3) ... [2020-08-27 21:49:53,039 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:53, skipping insertion in model container [2020-08-27 21:49:53,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:52" (2/3) ... [2020-08-27 21:49:53,040 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:53, skipping insertion in model container [2020-08-27 21:49:53,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:53" (3/3) ... [2020-08-27 21:49:53,042 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-1.c [2020-08-27 21:49:53,054 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:49:53,064 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:49:53,087 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:49:53,119 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:49:53,120 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:49:53,120 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:49:53,120 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:49:53,120 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:49:53,120 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:49:53,121 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:49:53,121 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:49:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-27 21:49:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-27 21:49:53,152 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:53,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:53,154 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:53,161 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-08-27 21:49:53,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:53,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978304749] [2020-08-27 21:49:53,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,404 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:53,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978304749] [2020-08-27 21:49:53,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:49:53,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:49:53,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148848769] [2020-08-27 21:49:53,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:49:53,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:49:53,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:49:53,445 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-27 21:49:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:53,531 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-27 21:49:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:49:53,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-27 21:49:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:53,547 INFO L225 Difference]: With dead ends: 30 [2020-08-27 21:49:53,547 INFO L226 Difference]: Without dead ends: 18 [2020-08-27 21:49:53,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-27 21:49:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-27 21:49:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-27 21:49:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-27 21:49:53,598 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-27 21:49:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:53,598 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-27 21:49:53,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:49:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-27 21:49:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-27 21:49:53,601 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:53,601 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:53,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:49:53,602 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-08-27 21:49:53,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:53,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [230722057] [2020-08-27 21:49:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,744 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:53,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [230722057] [2020-08-27 21:49:53,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:53,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:49:53,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773914167] [2020-08-27 21:49:53,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:49:53,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:53,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:49:53,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:53,749 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-27 21:49:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:53,810 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-27 21:49:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:49:53,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-27 21:49:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:53,812 INFO L225 Difference]: With dead ends: 25 [2020-08-27 21:49:53,812 INFO L226 Difference]: Without dead ends: 21 [2020-08-27 21:49:53,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-27 21:49:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-27 21:49:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-27 21:49:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-27 21:49:53,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-27 21:49:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:53,821 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-27 21:49:53,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:49:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-27 21:49:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-27 21:49:53,823 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:53,823 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:53,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:49:53,824 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-08-27 21:49:53,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:53,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1655061694] [2020-08-27 21:49:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,991 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:53,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1655061694] [2020-08-27 21:49:53,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:53,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:53,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396175001] [2020-08-27 21:49:53,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:53,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:53,995 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-27 21:49:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,065 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-27 21:49:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:49:54,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-27 21:49:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,068 INFO L225 Difference]: With dead ends: 28 [2020-08-27 21:49:54,068 INFO L226 Difference]: Without dead ends: 24 [2020-08-27 21:49:54,069 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:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-27 21:49:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-27 21:49:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-27 21:49:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-27 21:49:54,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-27 21:49:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,077 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-27 21:49:54,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-27 21:49:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-27 21:49:54,079 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,079 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:54,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:49:54,080 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-08-27 21:49:54,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [889822329] [2020-08-27 21:49:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,310 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:54,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [889822329] [2020-08-27 21:49:54,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:54,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:54,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318820693] [2020-08-27 21:49:54,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:54,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:54,313 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-27 21:49:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,404 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-27 21:49:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:49:54,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-27 21:49:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,407 INFO L225 Difference]: With dead ends: 31 [2020-08-27 21:49:54,407 INFO L226 Difference]: Without dead ends: 27 [2020-08-27 21:49:54,408 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:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-27 21:49:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-27 21:49:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-27 21:49:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-27 21:49:54,427 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-27 21:49:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,427 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-27 21:49:54,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-27 21:49:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-27 21:49:54,432 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,433 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:54,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:49:54,433 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-08-27 21:49:54,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399967637] [2020-08-27 21:49:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,795 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:54,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399967637] [2020-08-27 21:49:54,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:54,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:49:54,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787759034] [2020-08-27 21:49:54,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:49:54,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:49:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:49:54,800 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-27 21:49:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,919 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-27 21:49:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:54,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-27 21:49:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,923 INFO L225 Difference]: With dead ends: 34 [2020-08-27 21:49:54,923 INFO L226 Difference]: Without dead ends: 30 [2020-08-27 21:49:54,924 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:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-27 21:49:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-27 21:49:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-27 21:49:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-27 21:49:54,938 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-27 21:49:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,942 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-27 21:49:54,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:49:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-27 21:49:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-27 21:49:54,945 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,945 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:54,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:49:54,949 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-08-27 21:49:54,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1557812095] [2020-08-27 21:49:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,187 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:55,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1557812095] [2020-08-27 21:49:55,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:55,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245957170] [2020-08-27 21:49:55,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:55,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:55,190 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-27 21:49:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,288 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-27 21:49:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:49:55,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-27 21:49:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,290 INFO L225 Difference]: With dead ends: 37 [2020-08-27 21:49:55,290 INFO L226 Difference]: Without dead ends: 33 [2020-08-27 21:49:55,291 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:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-27 21:49:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-27 21:49:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-27 21:49:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-27 21:49:55,298 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-27 21:49:55,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,299 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-27 21:49:55,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-27 21:49:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-27 21:49:55,301 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,301 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:55,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:49:55,302 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-08-27 21:49:55,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878922592] [2020-08-27 21:49:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,525 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:55,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878922592] [2020-08-27 21:49:55,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-27 21:49:55,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660885757] [2020-08-27 21:49:55,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:49:55,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:49:55,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:49:55,529 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-27 21:49:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,657 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-27 21:49:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:49:55,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-27 21:49:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,659 INFO L225 Difference]: With dead ends: 40 [2020-08-27 21:49:55,660 INFO L226 Difference]: Without dead ends: 36 [2020-08-27 21:49:55,660 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:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-27 21:49:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-27 21:49:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-27 21:49:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-27 21:49:55,667 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-27 21:49:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,668 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-27 21:49:55,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:49:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-27 21:49:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-27 21:49:55,669 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,670 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:55,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:49:55,670 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-08-27 21:49:55,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120502507] [2020-08-27 21:49:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,910 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:55,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120502507] [2020-08-27 21:49:55,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-27 21:49:55,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390440618] [2020-08-27 21:49:55,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:49:55,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:49:55,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:55,913 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-27 21:49:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,029 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-27 21:49:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:49:56,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-27 21:49:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,031 INFO L225 Difference]: With dead ends: 43 [2020-08-27 21:49:56,031 INFO L226 Difference]: Without dead ends: 39 [2020-08-27 21:49:56,032 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:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-27 21:49:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-27 21:49:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-27 21:49:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-27 21:49:56,039 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-27 21:49:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,039 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-27 21:49:56,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:49:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-27 21:49:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-27 21:49:56,041 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,041 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:56,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:49:56,042 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-08-27 21:49:56,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99665999] [2020-08-27 21:49:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,352 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:56,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99665999] [2020-08-27 21:49:56,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-27 21:49:56,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607275486] [2020-08-27 21:49:56,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-27 21:49:56,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-27 21:49:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:49:56,360 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-27 21:49:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,539 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-27 21:49:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-27 21:49:56,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-27 21:49:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,542 INFO L225 Difference]: With dead ends: 46 [2020-08-27 21:49:56,542 INFO L226 Difference]: Without dead ends: 42 [2020-08-27 21:49:56,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-27 21:49:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-27 21:49:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-27 21:49:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-27 21:49:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-27 21:49:56,554 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-27 21:49:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,554 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-27 21:49:56,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-27 21:49:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-27 21:49:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-27 21:49:56,558 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,558 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:56,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:49:56,559 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-08-27 21:49:56,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1961143112] [2020-08-27 21:49:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,626 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,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,912 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:56,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1961143112] [2020-08-27 21:49:56,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-27 21:49:56,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159155598] [2020-08-27 21:49:56,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-27 21:49:56,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-27 21:49:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:56,915 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-27 21:49:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,090 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-27 21:49:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-27 21:49:57,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-27 21:49:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,092 INFO L225 Difference]: With dead ends: 49 [2020-08-27 21:49:57,092 INFO L226 Difference]: Without dead ends: 45 [2020-08-27 21:49:57,093 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:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-27 21:49:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-27 21:49:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-27 21:49:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-27 21:49:57,100 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-27 21:49:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,100 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-27 21:49:57,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-27 21:49:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-27 21:49:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-27 21:49:57,101 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,102 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:57,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:49:57,102 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-08-27 21:49:57,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520083800] [2020-08-27 21:49:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,557 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:57,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520083800] [2020-08-27 21:49:57,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-27 21:49:57,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256594758] [2020-08-27 21:49:57,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-27 21:49:57,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-27 21:49:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-08-27 21:49:57,560 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-08-27 21:49:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,719 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-27 21:49:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-27 21:49:57,719 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-08-27 21:49:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,721 INFO L225 Difference]: With dead ends: 52 [2020-08-27 21:49:57,721 INFO L226 Difference]: Without dead ends: 48 [2020-08-27 21:49:57,722 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:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-27 21:49:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-27 21:49:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-27 21:49:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-27 21:49:57,728 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-27 21:49:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,729 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-27 21:49:57,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-27 21:49:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-27 21:49:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-27 21:49:57,730 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,730 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:57,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:49:57,731 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-08-27 21:49:57,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922066123] [2020-08-27 21:49:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,202 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:49:58,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922066123] [2020-08-27 21:49:58,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:58,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-27 21:49:58,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293346325] [2020-08-27 21:49:58,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-27 21:49:58,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-27 21:49:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:49:58,205 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-27 21:49:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:58,394 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-27 21:49:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-27 21:49:58,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-27 21:49:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:58,396 INFO L225 Difference]: With dead ends: 55 [2020-08-27 21:49:58,396 INFO L226 Difference]: Without dead ends: 51 [2020-08-27 21:49:58,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-08-27 21:49:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-27 21:49:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-27 21:49:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-27 21:49:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-27 21:49:58,403 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-27 21:49:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:58,403 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-27 21:49:58,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-27 21:49:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-27 21:49:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-27 21:49:58,405 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:58,405 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:49:58,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:49:58,405 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-08-27 21:49:58,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:58,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1250034646] [2020-08-27 21:49:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,914 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:49:58,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1250034646] [2020-08-27 21:49:58,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:58,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-27 21:49:58,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664560353] [2020-08-27 21:49:58,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-27 21:49:58,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-27 21:49:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-08-27 21:49:58,916 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-08-27 21:49:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:59,105 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-27 21:49:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-27 21:49:59,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-08-27 21:49:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:59,107 INFO L225 Difference]: With dead ends: 58 [2020-08-27 21:49:59,107 INFO L226 Difference]: Without dead ends: 54 [2020-08-27 21:49:59,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-08-27 21:49:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-27 21:49:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-27 21:49:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-27 21:49:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-27 21:49:59,115 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-27 21:49:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:59,115 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-27 21:49:59,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-27 21:49:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-27 21:49:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-27 21:49:59,117 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:59,117 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:49:59,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:49:59,117 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-08-27 21:49:59,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:59,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1786263236] [2020-08-27 21:49:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,696 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:49:59,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1786263236] [2020-08-27 21:49:59,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:59,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-27 21:49:59,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191803869] [2020-08-27 21:49:59,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-27 21:49:59,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-27 21:49:59,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:49:59,700 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-08-27 21:49:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:59,931 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-27 21:49:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-27 21:49:59,932 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-08-27 21:49:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:59,933 INFO L225 Difference]: With dead ends: 61 [2020-08-27 21:49:59,933 INFO L226 Difference]: Without dead ends: 57 [2020-08-27 21:49:59,934 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:49:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-27 21:49:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-27 21:49:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-27 21:49:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-27 21:49:59,940 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-27 21:49:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:59,940 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-27 21:49:59,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-27 21:49:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-27 21:49:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-27 21:49:59,942 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:59,942 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:49:59,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-27 21:49:59,942 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-08-27 21:49:59,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:59,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167718862] [2020-08-27 21:49:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,558 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:00,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167718862] [2020-08-27 21:50:00,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:00,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-27 21:50:00,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222271494] [2020-08-27 21:50:00,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-27 21:50:00,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-27 21:50:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-08-27 21:50:00,561 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-08-27 21:50:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:00,797 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-27 21:50:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-27 21:50:00,798 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-08-27 21:50:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:00,799 INFO L225 Difference]: With dead ends: 64 [2020-08-27 21:50:00,799 INFO L226 Difference]: Without dead ends: 60 [2020-08-27 21:50:00,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-08-27 21:50:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-27 21:50:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-27 21:50:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-27 21:50:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-27 21:50:00,812 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-27 21:50:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:00,813 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-27 21:50:00,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-27 21:50:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-27 21:50:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-27 21:50:00,815 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:00,816 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:00,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-27 21:50:00,816 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-08-27 21:50:00,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:00,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554365869] [2020-08-27 21:50:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,391 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:02,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554365869] [2020-08-27 21:50:02,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:02,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2020-08-27 21:50:02,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629871862] [2020-08-27 21:50:02,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-08-27 21:50:02,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-08-27 21:50:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-08-27 21:50:02,397 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 35 states. [2020-08-27 21:50:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:02,982 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-27 21:50:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-27 21:50:02,983 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 103 [2020-08-27 21:50:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:02,986 INFO L225 Difference]: With dead ends: 67 [2020-08-27 21:50:02,986 INFO L226 Difference]: Without dead ends: 63 [2020-08-27 21:50:02,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-08-27 21:50:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-27 21:50:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-27 21:50:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-27 21:50:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-27 21:50:02,991 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-27 21:50:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:02,992 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-27 21:50:02,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-08-27 21:50:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-27 21:50:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-27 21:50:02,994 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:02,994 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:02,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-27 21:50:02,994 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2020-08-27 21:50:02,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:02,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314058653] [2020-08-27 21:50:02,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,676 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,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 360 proven. 32 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-27 21:50:03,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314058653] [2020-08-27 21:50:03,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:03,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-27 21:50:03,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093693962] [2020-08-27 21:50:03,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-27 21:50:03,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-27 21:50:03,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:50:03,902 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-08-27 21:50:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:04,912 INFO L93 Difference]: Finished difference Result 152 states and 408 transitions. [2020-08-27 21:50:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-08-27 21:50:04,912 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-08-27 21:50:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:04,913 INFO L225 Difference]: With dead ends: 152 [2020-08-27 21:50:04,913 INFO L226 Difference]: Without dead ends: 0 [2020-08-27 21:50:04,916 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=467, Invalid=939, Unknown=0, NotChecked=0, Total=1406 [2020-08-27 21:50:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-27 21:50:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-27 21:50:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-27 21:50:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-27 21:50:04,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2020-08-27 21:50:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:04,918 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-27 21:50:04,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-27 21:50:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-27 21:50:04,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-27 21:50:04,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-27 21:50:04,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-27 21:50:05,063 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-27 21:50:05,063 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:50:05,063 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:50:05,064 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-27 21:50:05,064 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-27 21:50:05,064 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-27 21:50:05,064 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-08-27 21:50:05,064 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-08-27 21:50:05,064 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 15) no Hoare annotation was computed. [2020-08-27 21:50:05,064 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-08-27 21:50:05,065 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-08-27 21:50:05,065 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 15) (<= 15 main_~input~0)) [2020-08-27 21:50:05,065 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-08-27 21:50:05,065 INFO L268 CegarLoopResult]: For program point L12-2(lines 9 15) no Hoare annotation was computed. [2020-08-27 21:50:05,065 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-08-27 21:50:05,065 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-08-27 21:50:05,065 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-08-27 21:50:05,066 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-08-27 21:50:05,067 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-08-27 21:50:05,067 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-08-27 21:50:05,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:50:05 BoogieIcfgContainer [2020-08-27 21:50:05,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:50:05,092 INFO L168 Benchmark]: Toolchain (without parser) took 12740.39 ms. Allocated memory was 145.2 MB in the beginning and 403.2 MB in the end (delta: 257.9 MB). Free memory was 101.6 MB in the beginning and 314.3 MB in the end (delta: -212.7 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:05,097 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-27 21:50:05,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.48 ms. Allocated memory is still 145.2 MB. Free memory was 101.4 MB in the beginning and 91.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:05,099 INFO L168 Benchmark]: Boogie Preprocessor took 30.23 ms. Allocated memory is still 145.2 MB. Free memory was 91.7 MB in the beginning and 90.3 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:05,099 INFO L168 Benchmark]: RCFGBuilder took 363.48 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 90.3 MB in the beginning and 169.8 MB in the end (delta: -79.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:05,100 INFO L168 Benchmark]: TraceAbstraction took 12053.89 ms. Allocated memory was 201.9 MB in the beginning and 403.2 MB in the end (delta: 201.3 MB). Free memory was 169.8 MB in the beginning and 314.3 MB in the end (delta: -144.5 MB). Peak memory consumption was 56.9 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:05,108 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.48 ms. Allocated memory is still 145.2 MB. Free memory was 101.4 MB in the beginning and 91.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.23 ms. Allocated memory is still 145.2 MB. Free memory was 91.7 MB in the beginning and 90.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.48 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 90.3 MB in the beginning and 169.8 MB in the end (delta: -79.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12053.89 ms. Allocated memory was 201.9 MB in the beginning and 403.2 MB in the end (delta: 201.3 MB). Free memory was 169.8 MB in the beginning and 314.3 MB in the end (delta: -144.5 MB). Peak memory consumption was 56.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.8s, OverallIterations: 17, TraceHistogramMax: 17, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 284 SDtfs, 396 SDslu, 2152 SDs, 0 SdLazy, 2096 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 39 PreInvPairs, 39 NumberOfFragments, 15 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 181 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1037 NumberOfCodeBlocks, 1037 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1020 ConstructedInterpolants, 0 QuantifiedInterpolants, 203208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 2672/4624 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...