/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_i20_o20-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:49:51,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:49:52,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:49:52,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:49:52,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:49:52,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:49:52,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:49:52,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:49:52,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:49:52,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:49:52,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:49:52,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:49:52,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:49:52,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:49:52,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:49:52,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:49:52,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:49:52,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:49:52,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:49:52,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:49:52,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:49:52,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:49:52,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:49:52,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:49:52,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:49:52,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:49:52,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:49:52,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:49:52,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:49:52,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:49:52,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:49:52,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:49:52,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:49:52,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:49:52,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:49:52,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:49:52,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:49:52,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:49:52,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:49:52,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:49:52,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:49:52,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:49:52,161 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:49:52,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:49:52,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:49:52,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:49:52,164 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:49:52,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:49:52,165 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:49:52,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:49:52,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:49:52,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:49:52,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:49:52,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:49:52,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:49:52,167 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:49:52,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:49:52,168 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:49:52,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:49:52,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:49:52,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:49:52,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:49:52,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:49:52,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:52,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:49:52,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:49:52,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:49:52,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:49:52,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:49:52,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:49:52,170 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:49:52,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-27 21:49:52,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:49:52,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:49:52,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:49:52,716 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:49:52,716 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:49:52,717 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-08-27 21:49:52,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ce3ac82ec/77f2b9a092674a30af7fef32d1636262/FLAG2f7226fac [2020-08-27 21:49:53,270 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:49:53,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-08-27 21:49:53,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ce3ac82ec/77f2b9a092674a30af7fef32d1636262/FLAG2f7226fac [2020-08-27 21:49:53,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ce3ac82ec/77f2b9a092674a30af7fef32d1636262 [2020-08-27 21:49:53,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:49:53,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:49:53,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:53,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:49:53,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:49:53,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321fecde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53, skipping insertion in model container [2020-08-27 21:49:53,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:53" (1/1) ... [2020-08-27 21:49:53,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:49:53,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:49:53,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:53,969 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:49:53,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:53,999 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:49:54,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53 WrapperNode [2020-08-27 21:49:54,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:54,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:49:54,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:49:54,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:49:54,015 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:53" (1/1) ... [2020-08-27 21:49:54,015 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:53" (1/1) ... [2020-08-27 21:49:54,020 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:53" (1/1) ... [2020-08-27 21:49:54,020 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:53" (1/1) ... [2020-08-27 21:49:54,024 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:53" (1/1) ... [2020-08-27 21:49:54,026 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:53" (1/1) ... [2020-08-27 21:49:54,027 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:53" (1/1) ... [2020-08-27 21:49:54,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:49:54,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:49:54,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:49:54,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:49:54,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:54,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:49:54,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:49:54,187 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-27 21:49:54,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:49:54,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:49:54,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:49:54,188 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-27 21:49:54,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:49:54,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:49:54,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:49:54,378 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:49:54,378 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:49:54,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:54 BoogieIcfgContainer [2020-08-27 21:49:54,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:49:54,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:49:54,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:49:54,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:49:54,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:49:53" (1/3) ... [2020-08-27 21:49:54,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742c8e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:54, skipping insertion in model container [2020-08-27 21:49:54,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:53" (2/3) ... [2020-08-27 21:49:54,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742c8e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:54, skipping insertion in model container [2020-08-27 21:49:54,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:54" (3/3) ... [2020-08-27 21:49:54,393 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2020-08-27 21:49:54,402 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:49:54,410 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:49:54,432 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:49:54,462 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:49:54,462 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:49:54,462 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:49:54,462 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:49:54,462 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:49:54,463 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:49:54,463 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:49:54,463 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:49:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-27 21:49:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-27 21:49:54,488 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,490 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-08-27 21:49:54,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296193446] [2020-08-27 21:49:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:49:54,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296193446] [2020-08-27 21:49:54,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:49:54,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:49:54,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727224759] [2020-08-27 21:49:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:49:54,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:49:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:49:54,888 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-27 21:49:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,973 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-27 21:49:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:49:54,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-27 21:49:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,989 INFO L225 Difference]: With dead ends: 30 [2020-08-27 21:49:54,990 INFO L226 Difference]: Without dead ends: 18 [2020-08-27 21:49:54,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-27 21:49:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-27 21:49:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-27 21:49:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-27 21:49:55,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-27 21:49:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,049 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-27 21:49:55,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:49:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-27 21:49:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-27 21:49:55,051 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,052 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:49:55,052 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,053 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-08-27 21:49:55,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898493675] [2020-08-27 21:49:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-27 21:49:55,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898493675] [2020-08-27 21:49:55,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:49:55,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351446692] [2020-08-27 21:49:55,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:49:55,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:49:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:55,201 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-27 21:49:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,266 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-27 21:49:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:49:55,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-27 21:49:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,269 INFO L225 Difference]: With dead ends: 25 [2020-08-27 21:49:55,269 INFO L226 Difference]: Without dead ends: 21 [2020-08-27 21:49:55,270 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:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-27 21:49:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-27 21:49:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-27 21:49:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-27 21:49:55,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-27 21:49:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,278 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-27 21:49:55,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:49:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-27 21:49:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-27 21:49:55,280 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,280 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:49:55,281 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,281 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-08-27 21:49:55,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2104699332] [2020-08-27 21:49:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-27 21:49:55,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2104699332] [2020-08-27 21:49:55,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:55,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921254502] [2020-08-27 21:49:55,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:55,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:55,452 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-27 21:49:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,531 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-27 21:49:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:49:55,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-27 21:49:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,533 INFO L225 Difference]: With dead ends: 28 [2020-08-27 21:49:55,533 INFO L226 Difference]: Without dead ends: 24 [2020-08-27 21:49:55,534 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-27 21:49:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-27 21:49:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-27 21:49:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-27 21:49:55,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-27 21:49:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,542 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-27 21:49:55,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-27 21:49:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-27 21:49:55,543 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,543 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:49:55,544 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-08-27 21:49:55,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949897149] [2020-08-27 21:49:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,712 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:55,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949897149] [2020-08-27 21:49:55,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:55,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20211887] [2020-08-27 21:49:55,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:55,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:55,715 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-27 21:49:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,820 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-27 21:49:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:49:55,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-27 21:49:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,822 INFO L225 Difference]: With dead ends: 31 [2020-08-27 21:49:55,822 INFO L226 Difference]: Without dead ends: 27 [2020-08-27 21:49:55,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-27 21:49:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-27 21:49:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-27 21:49:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-27 21:49:55,830 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-27 21:49:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,831 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-27 21:49:55,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-27 21:49:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-27 21:49:55,833 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,833 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:55,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:49:55,835 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-08-27 21:49:55,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [612816640] [2020-08-27 21:49:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [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 2 [2020-08-27 21:49:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-27 21:49:56,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [612816640] [2020-08-27 21:49:56,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:49:56,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283254209] [2020-08-27 21:49:56,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:49:56,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:49:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:49:56,122 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-27 21:49:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,217 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-27 21:49:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:56,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-27 21:49:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,219 INFO L225 Difference]: With dead ends: 34 [2020-08-27 21:49:56,219 INFO L226 Difference]: Without dead ends: 30 [2020-08-27 21:49:56,220 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-27 21:49:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-27 21:49:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-27 21:49:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-27 21:49:56,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-27 21:49:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,228 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-27 21:49:56,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:49:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-27 21:49:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-27 21:49:56,230 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,230 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:56,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:49:56,230 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-08-27 21:49:56,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675426972] [2020-08-27 21:49:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-27 21:49:56,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675426972] [2020-08-27 21:49:56,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:56,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775481293] [2020-08-27 21:49:56,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:56,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:56,468 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-27 21:49:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,577 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-27 21:49:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:49:56,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-27 21:49:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,580 INFO L225 Difference]: With dead ends: 37 [2020-08-27 21:49:56,580 INFO L226 Difference]: Without dead ends: 33 [2020-08-27 21:49:56,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:49:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-27 21:49:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-27 21:49:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-27 21:49:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-27 21:49:56,593 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-27 21:49:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,593 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-27 21:49:56,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-27 21:49:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-27 21:49:56,596 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,596 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:56,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:49:56,596 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-08-27 21:49:56,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1557365644] [2020-08-27 21:49:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,733 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,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,833 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:56,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1557365644] [2020-08-27 21:49:56,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-27 21:49:56,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328064352] [2020-08-27 21:49:56,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:49:56,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:49:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:49:56,836 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-27 21:49:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:56,976 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-27 21:49:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:49:56,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-27 21:49:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:56,978 INFO L225 Difference]: With dead ends: 40 [2020-08-27 21:49:56,978 INFO L226 Difference]: Without dead ends: 36 [2020-08-27 21:49:56,979 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:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-27 21:49:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-27 21:49:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-27 21:49:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-27 21:49:56,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-27 21:49:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:56,987 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-27 21:49:56,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:49:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-27 21:49:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-27 21:49:56,988 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:56,988 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:56,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:49:56,989 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-08-27 21:49:56,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:56,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [844507939] [2020-08-27 21:49:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-27 21:49:57,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [844507939] [2020-08-27 21:49:57,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-27 21:49:57,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508457702] [2020-08-27 21:49:57,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:49:57,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:49:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:57,248 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-27 21:49:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,365 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-27 21:49:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:49:57,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-27 21:49:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,367 INFO L225 Difference]: With dead ends: 43 [2020-08-27 21:49:57,367 INFO L226 Difference]: Without dead ends: 39 [2020-08-27 21:49:57,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-08-27 21:49:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-27 21:49:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-27 21:49:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-27 21:49:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-27 21:49:57,375 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-27 21:49:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,376 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-27 21:49:57,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:49:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-27 21:49:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-27 21:49:57,377 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,377 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:57,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:49:57,378 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-08-27 21:49:57,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748207143] [2020-08-27 21:49:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,691 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:57,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748207143] [2020-08-27 21:49:57,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-27 21:49:57,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657546922] [2020-08-27 21:49:57,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-27 21:49:57,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-27 21:49:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:49:57,699 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-27 21:49:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,838 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-27 21:49:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-27 21:49:57,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-27 21:49:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,840 INFO L225 Difference]: With dead ends: 46 [2020-08-27 21:49:57,840 INFO L226 Difference]: Without dead ends: 42 [2020-08-27 21:49:57,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-27 21:49:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-27 21:49:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-27 21:49:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-27 21:49:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-27 21:49:57,848 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-27 21:49:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,848 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-27 21:49:57,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-27 21:49:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-27 21:49:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-27 21:49:57,850 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,850 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:57,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:49:57,851 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-08-27 21:49:57,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067016473] [2020-08-27 21:49:57,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,885 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 5 [2020-08-27 21:49:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-27 21:49:58,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067016473] [2020-08-27 21:49:58,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:58,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-27 21:49:58,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083094177] [2020-08-27 21:49:58,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-27 21:49:58,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-27 21:49:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:58,193 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-27 21:49:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:58,375 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-27 21:49:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-27 21:49:58,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-27 21:49:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:58,377 INFO L225 Difference]: With dead ends: 49 [2020-08-27 21:49:58,377 INFO L226 Difference]: Without dead ends: 45 [2020-08-27 21:49:58,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-08-27 21:49:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-27 21:49:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-27 21:49:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-27 21:49:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-27 21:49:58,394 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-27 21:49:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:58,395 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-27 21:49:58,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-27 21:49:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-27 21:49:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-27 21:49:58,403 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:58,403 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:58,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:49:58,403 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:58,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-08-27 21:49:58,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:58,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982311816] [2020-08-27 21:49:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:58,847 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:58,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982311816] [2020-08-27 21:49:58,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:58,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-27 21:49:58,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792941113] [2020-08-27 21:49:58,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-27 21:49:58,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-27 21:49:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-08-27 21:49:58,852 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-08-27 21:49:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:59,001 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-27 21:49:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-27 21:49:59,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-08-27 21:49:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:59,003 INFO L225 Difference]: With dead ends: 52 [2020-08-27 21:49:59,003 INFO L226 Difference]: Without dead ends: 48 [2020-08-27 21:49:59,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-08-27 21:49:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-27 21:49:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-27 21:49:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-27 21:49:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-27 21:49:59,010 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-27 21:49:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:59,010 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-27 21:49:59,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-27 21:49:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-27 21:49:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-27 21:49:59,012 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:59,012 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:59,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:49:59,012 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-08-27 21:49:59,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:59,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626531534] [2020-08-27 21:49:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,219 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,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,529 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:59,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626531534] [2020-08-27 21:49:59,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:59,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-27 21:49:59,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395758965] [2020-08-27 21:49:59,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-27 21:49:59,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-27 21:49:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:49:59,532 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-27 21:49:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:59,729 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-27 21:49:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-27 21:49:59,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-27 21:49:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:59,730 INFO L225 Difference]: With dead ends: 55 [2020-08-27 21:49:59,730 INFO L226 Difference]: Without dead ends: 51 [2020-08-27 21:49:59,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-08-27 21:49:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-27 21:49:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-27 21:49:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-27 21:49:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-27 21:49:59,743 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-27 21:49:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:59,743 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-27 21:49:59,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-27 21:49:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-27 21:49:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-27 21:49:59,748 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:59,748 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:59,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:49:59,748 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-08-27 21:49:59,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:59,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1965020525] [2020-08-27 21:49:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:59,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,224 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,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-27 21:50:00,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1965020525] [2020-08-27 21:50:00,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:00,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-27 21:50:00,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738406097] [2020-08-27 21:50:00,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-27 21:50:00,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:00,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-27 21:50:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-08-27 21:50:00,366 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-08-27 21:50:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:00,559 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-27 21:50:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-27 21:50:00,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-08-27 21:50:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:00,561 INFO L225 Difference]: With dead ends: 58 [2020-08-27 21:50:00,561 INFO L226 Difference]: Without dead ends: 54 [2020-08-27 21:50:00,563 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:50:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-27 21:50:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-27 21:50:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-27 21:50:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-27 21:50:00,573 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-27 21:50:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:00,576 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-27 21:50:00,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-27 21:50:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-27 21:50:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-27 21:50:00,577 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:00,578 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:00,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:50:00,578 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-08-27 21:50:00,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:00,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1886253269] [2020-08-27 21:50:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:00,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-27 21:50:01,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1886253269] [2020-08-27 21:50:01,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:01,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-27 21:50:01,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720941783] [2020-08-27 21:50:01,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-27 21:50:01,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:01,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-27 21:50:01,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-08-27 21:50:01,211 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-08-27 21:50:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:01,421 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-27 21:50:01,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-27 21:50:01,422 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-08-27 21:50:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:01,424 INFO L225 Difference]: With dead ends: 61 [2020-08-27 21:50:01,424 INFO L226 Difference]: Without dead ends: 57 [2020-08-27 21:50:01,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-08-27 21:50:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-27 21:50:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-27 21:50:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-27 21:50:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-27 21:50:01,441 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-27 21:50:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:01,442 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-27 21:50:01,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-27 21:50:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-27 21:50:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-27 21:50:01,443 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:01,443 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:01,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-27 21:50:01,445 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-08-27 21:50:01,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:01,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [9286346] [2020-08-27 21:50:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:01,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-27 21:50:02,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [9286346] [2020-08-27 21:50:02,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:02,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-27 21:50:02,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67229170] [2020-08-27 21:50:02,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-27 21:50:02,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:02,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-27 21:50:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-08-27 21:50:02,111 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-08-27 21:50:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:02,343 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-27 21:50:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-27 21:50:02,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-08-27 21:50:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:02,345 INFO L225 Difference]: With dead ends: 64 [2020-08-27 21:50:02,345 INFO L226 Difference]: Without dead ends: 60 [2020-08-27 21:50:02,347 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:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-27 21:50:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-27 21:50:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-27 21:50:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-27 21:50:02,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-27 21:50:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:02,362 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-27 21:50:02,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-27 21:50:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-27 21:50:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-27 21:50:02,364 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:02,364 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:02,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-27 21:50:02,365 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-08-27 21:50:02,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:02,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1313906718] [2020-08-27 21:50:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:02,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-08-27 21:50:03,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1313906718] [2020-08-27 21:50:03,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:03,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-27 21:50:03,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521615038] [2020-08-27 21:50:03,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-27 21:50:03,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:03,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-27 21:50:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-08-27 21:50:03,093 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-08-27 21:50:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:03,344 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-27 21:50:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-27 21:50:03,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2020-08-27 21:50:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:03,345 INFO L225 Difference]: With dead ends: 67 [2020-08-27 21:50:03,345 INFO L226 Difference]: Without dead ends: 63 [2020-08-27 21:50:03,347 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-08-27 21:50:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-27 21:50:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-27 21:50:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-27 21:50:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-27 21:50:03,352 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-27 21:50:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:03,353 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-27 21:50:03,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-27 21:50:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-27 21:50:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-27 21:50:03,354 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:03,355 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:03,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-27 21:50:03,355 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2020-08-27 21:50:03,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:03,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075700371] [2020-08-27 21:50:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:03,421 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,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:03,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-27 21:50:04,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075700371] [2020-08-27 21:50:04,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:04,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-27 21:50:04,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281484511] [2020-08-27 21:50:04,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-27 21:50:04,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-27 21:50:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:50:04,135 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-08-27 21:50:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:04,411 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-08-27 21:50:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-27 21:50:04,411 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-08-27 21:50:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:04,413 INFO L225 Difference]: With dead ends: 70 [2020-08-27 21:50:04,413 INFO L226 Difference]: Without dead ends: 66 [2020-08-27 21:50:04,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-08-27 21:50:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-27 21:50:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-27 21:50:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-27 21:50:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-08-27 21:50:04,422 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-08-27 21:50:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:04,423 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-08-27 21:50:04,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-27 21:50:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-08-27 21:50:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-27 21:50:04,425 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:04,425 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:04,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-27 21:50:04,426 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:04,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:04,426 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2020-08-27 21:50:04,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:04,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169578063] [2020-08-27 21:50:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:04,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-08-27 21:50:05,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169578063] [2020-08-27 21:50:05,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:05,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-08-27 21:50:05,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508672253] [2020-08-27 21:50:05,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-27 21:50:05,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-27 21:50:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-08-27 21:50:05,249 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2020-08-27 21:50:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:05,552 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-08-27 21:50:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-27 21:50:05,552 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2020-08-27 21:50:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:05,553 INFO L225 Difference]: With dead ends: 73 [2020-08-27 21:50:05,553 INFO L226 Difference]: Without dead ends: 69 [2020-08-27 21:50:05,555 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-08-27 21:50:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-27 21:50:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-27 21:50:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-27 21:50:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-08-27 21:50:05,559 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-08-27 21:50:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:05,563 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-08-27 21:50:05,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-27 21:50:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-08-27 21:50:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-27 21:50:05,566 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:05,566 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:05,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-27 21:50:05,566 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:05,567 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2020-08-27 21:50:05,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:05,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1782672912] [2020-08-27 21:50:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:05,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-08-27 21:50:06,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1782672912] [2020-08-27 21:50:06,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:06,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-27 21:50:06,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44959188] [2020-08-27 21:50:06,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-27 21:50:06,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:06,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-27 21:50:06,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-08-27 21:50:06,650 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2020-08-27 21:50:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:06,978 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-08-27 21:50:06,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-27 21:50:06,978 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2020-08-27 21:50:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:06,979 INFO L225 Difference]: With dead ends: 76 [2020-08-27 21:50:06,980 INFO L226 Difference]: Without dead ends: 72 [2020-08-27 21:50:06,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-08-27 21:50:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-08-27 21:50:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-08-27 21:50:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-27 21:50:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-08-27 21:50:06,987 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-08-27 21:50:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:06,988 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-08-27 21:50:06,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-27 21:50:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-08-27 21:50:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-27 21:50:06,989 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:06,989 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:06,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-27 21:50:06,989 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2020-08-27 21:50:06,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:06,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178556476] [2020-08-27 21:50:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:50:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:50:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:07,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:50:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:50:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-08-27 21:50:08,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178556476] [2020-08-27 21:50:08,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:50:08,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-08-27 21:50:08,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919149199] [2020-08-27 21:50:08,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-08-27 21:50:08,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:50:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-08-27 21:50:08,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-08-27 21:50:08,091 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2020-08-27 21:50:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:50:08,501 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-08-27 21:50:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-27 21:50:08,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2020-08-27 21:50:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:50:08,503 INFO L225 Difference]: With dead ends: 79 [2020-08-27 21:50:08,504 INFO L226 Difference]: Without dead ends: 75 [2020-08-27 21:50:08,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-08-27 21:50:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-27 21:50:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-08-27 21:50:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-08-27 21:50:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-08-27 21:50:08,519 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-08-27 21:50:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:50:08,519 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-08-27 21:50:08,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-08-27 21:50:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-08-27 21:50:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-27 21:50:08,521 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:50:08,522 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:50:08,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-27 21:50:08,522 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:50:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:50:08,523 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2020-08-27 21:50:08,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:50:08,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1805524779] [2020-08-27 21:50:08,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:50:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-27 21:50:08,604 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-27 21:50:08,604 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-27 21:50:08,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-27 21:50:08,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:50:08 BoogieIcfgContainer [2020-08-27 21:50:08,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:50:08,649 INFO L168 Benchmark]: Toolchain (without parser) took 15018.82 ms. Allocated memory was 138.4 MB in the beginning and 493.4 MB in the end (delta: 354.9 MB). Free memory was 102.1 MB in the beginning and 460.3 MB in the end (delta: -358.1 MB). Peak memory consumption was 331.6 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:08,649 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-27 21:50:08,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.20 ms. Allocated memory is still 138.4 MB. Free memory was 101.9 MB in the beginning and 92.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:08,651 INFO L168 Benchmark]: Boogie Preprocessor took 27.61 ms. Allocated memory is still 138.4 MB. Free memory was 92.7 MB in the beginning and 91.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:08,652 INFO L168 Benchmark]: RCFGBuilder took 354.04 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.3 MB in the beginning and 170.1 MB in the end (delta: -78.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:08,652 INFO L168 Benchmark]: TraceAbstraction took 14261.00 ms. Allocated memory was 201.9 MB in the beginning and 493.4 MB in the end (delta: 291.5 MB). Free memory was 169.4 MB in the beginning and 460.3 MB in the end (delta: -290.8 MB). Peak memory consumption was 335.5 MB. Max. memory is 7.1 GB. [2020-08-27 21:50:08,656 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.14 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 371.20 ms. Allocated memory is still 138.4 MB. Free memory was 101.9 MB in the beginning and 92.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.61 ms. Allocated memory is still 138.4 MB. Free memory was 92.7 MB in the beginning and 91.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.04 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.3 MB in the beginning and 170.1 MB in the end (delta: -78.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14261.00 ms. Allocated memory was 201.9 MB in the beginning and 493.4 MB in the end (delta: 291.5 MB). Free memory was 169.4 MB in the beginning and 460.3 MB in the end (delta: -290.8 MB). Peak memory consumption was 335.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 20; [L11] CALL, EXPR id(input) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND TRUE x==0 [L5] return 0; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.1s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 264 SDtfs, 523 SDslu, 1198 SDs, 0 SdLazy, 710 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1533 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 301200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...