/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_o20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:42,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:42,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:42,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:42,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:42,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:42,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:42,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:42,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:42,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:42,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:42,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:42,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:42,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:42,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:42,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:42,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:42,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:42,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:42,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:42,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:42,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:42,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:42,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:42,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:42,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:42,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:42,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:42,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:42,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:42,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:42,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:42,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:42,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:42,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:42,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:42,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:42,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:42,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:42,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:42,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:42,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:19:42,444 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:42,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:42,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:42,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:42,447 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:42,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:42,447 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:42,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:42,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:42,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:42,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:42,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:42,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:42,450 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:42,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:42,450 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:42,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:42,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:42,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:42,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:42,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:42,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:42,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:42,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:42,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:42,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:42,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:42,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:42,453 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:42,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:19:42,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:42,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:42,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:42,921 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:42,921 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:42,923 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c [2020-09-21 10:19:43,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/18d203fdf/fc739837ed2d425e9a23f850d0b7eb60/FLAG1ce189741 [2020-09-21 10:19:43,560 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:43,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_o20.c [2020-09-21 10:19:43,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/18d203fdf/fc739837ed2d425e9a23f850d0b7eb60/FLAG1ce189741 [2020-09-21 10:19:43,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/18d203fdf/fc739837ed2d425e9a23f850d0b7eb60 [2020-09-21 10:19:43,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:43,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:43,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:43,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:43,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:43,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:43" (1/1) ... [2020-09-21 10:19:43,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1038c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:43, skipping insertion in model container [2020-09-21 10:19:43,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:43" (1/1) ... [2020-09-21 10:19:43,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:44,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:44,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:44,228 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:44,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:44,259 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:44,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44 WrapperNode [2020-09-21 10:19:44,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:44,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:44,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:44,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:44,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... [2020-09-21 10:19:44,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... [2020-09-21 10:19:44,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... [2020-09-21 10:19:44,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... [2020-09-21 10:19:44,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... [2020-09-21 10:19:44,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... [2020-09-21 10:19:44,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... [2020-09-21 10:19:44,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:44,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:44,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:44,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:44,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-21 10:19:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-21 10:19:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-21 10:19:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:44,644 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:44,645 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:44,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:44 BoogieIcfgContainer [2020-09-21 10:19:44,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:44,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:44,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:44,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:44,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:43" (1/3) ... [2020-09-21 10:19:44,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceacb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:44, skipping insertion in model container [2020-09-21 10:19:44,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:44" (2/3) ... [2020-09-21 10:19:44,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceacb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:44, skipping insertion in model container [2020-09-21 10:19:44,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:44" (3/3) ... [2020-09-21 10:19:44,660 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o20.c [2020-09-21 10:19:44,671 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:44,680 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:44,702 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:44,734 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:44,735 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:44,735 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:44,735 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:44,735 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:44,735 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:44,736 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:44,736 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-09-21 10:19:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:44,764 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:44,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:44,766 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-09-21 10:19:44,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:44,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [262019653] [2020-09-21 10:19:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,106 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2020-09-21 10:19:45,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:45,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [262019653] [2020-09-21 10:19:45,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:45,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:45,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516388884] [2020-09-21 10:19:45,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:45,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:45,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:45,250 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-09-21 10:19:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:45,305 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-09-21 10:19:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:45,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:45,320 INFO L225 Difference]: With dead ends: 32 [2020-09-21 10:19:45,320 INFO L226 Difference]: Without dead ends: 18 [2020-09-21 10:19:45,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-09-21 10:19:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-09-21 10:19:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-09-21 10:19:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-09-21 10:19:45,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-09-21 10:19:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:45,376 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-09-21 10:19:45,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-09-21 10:19:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:19:45,379 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:45,379 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:45,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:45,379 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-09-21 10:19:45,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:45,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391765550] [2020-09-21 10:19:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-21 10:19:45,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [391765550] [2020-09-21 10:19:45,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:45,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:45,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620988476] [2020-09-21 10:19:45,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:45,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:45,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:45,637 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2020-09-21 10:19:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:45,670 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-09-21 10:19:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:45,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-21 10:19:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:45,673 INFO L225 Difference]: With dead ends: 25 [2020-09-21 10:19:45,673 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:19:45,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:19:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:19:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-09-21 10:19:45,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-09-21 10:19:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:45,682 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-09-21 10:19:45,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-09-21 10:19:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:19:45,684 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:45,684 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:45,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:45,685 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-09-21 10:19:45,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:45,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65846401] [2020-09-21 10:19:45,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-21 10:19:45,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65846401] [2020-09-21 10:19:45,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:45,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:19:45,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729684411] [2020-09-21 10:19:45,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:19:45,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:19:45,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:19:45,987 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-09-21 10:19:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:46,033 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-09-21 10:19:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:46,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-21 10:19:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:46,035 INFO L225 Difference]: With dead ends: 28 [2020-09-21 10:19:46,036 INFO L226 Difference]: Without dead ends: 24 [2020-09-21 10:19:46,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:19:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-21 10:19:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-21 10:19:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-21 10:19:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-09-21 10:19:46,044 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-09-21 10:19:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:46,045 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-09-21 10:19:46,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:19:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-09-21 10:19:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:19:46,046 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:46,047 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:46,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:46,047 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-09-21 10:19:46,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:46,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981822547] [2020-09-21 10:19:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-21 10:19:46,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981822547] [2020-09-21 10:19:46,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:46,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:46,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743833966] [2020-09-21 10:19:46,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:46,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:46,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:46,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:46,397 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2020-09-21 10:19:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:46,478 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-21 10:19:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:19:46,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2020-09-21 10:19:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:46,480 INFO L225 Difference]: With dead ends: 31 [2020-09-21 10:19:46,480 INFO L226 Difference]: Without dead ends: 27 [2020-09-21 10:19:46,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-09-21 10:19:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-09-21 10:19:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-21 10:19:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-09-21 10:19:46,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-09-21 10:19:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:46,488 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-09-21 10:19:46,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-09-21 10:19:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-21 10:19:46,490 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:46,490 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:46,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:19:46,490 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-09-21 10:19:46,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:46,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259048955] [2020-09-21 10:19:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-21 10:19:46,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259048955] [2020-09-21 10:19:46,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:46,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:19:46,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170507291] [2020-09-21 10:19:46,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:19:46,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:19:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:19:46,798 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2020-09-21 10:19:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:46,876 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-21 10:19:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:19:46,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-09-21 10:19:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:46,878 INFO L225 Difference]: With dead ends: 34 [2020-09-21 10:19:46,878 INFO L226 Difference]: Without dead ends: 30 [2020-09-21 10:19:46,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:19:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-21 10:19:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-21 10:19:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:19:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-21 10:19:46,886 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-09-21 10:19:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:46,886 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-21 10:19:46,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:19:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-21 10:19:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-21 10:19:46,888 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:46,888 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:46,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:19:46,889 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:46,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-09-21 10:19:46,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:46,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839146693] [2020-09-21 10:19:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:46,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-21 10:19:47,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839146693] [2020-09-21 10:19:47,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:47,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-21 10:19:47,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737063210] [2020-09-21 10:19:47,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-21 10:19:47,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:47,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-21 10:19:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:19:47,282 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2020-09-21 10:19:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:47,381 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-09-21 10:19:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-21 10:19:47,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-09-21 10:19:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:47,383 INFO L225 Difference]: With dead ends: 37 [2020-09-21 10:19:47,383 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:19:47,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:19:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:19:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-21 10:19:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-21 10:19:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-21 10:19:47,391 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-09-21 10:19:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:47,391 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-21 10:19:47,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-21 10:19:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-21 10:19:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-21 10:19:47,393 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:47,393 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:47,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:19:47,394 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:47,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-09-21 10:19:47,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:47,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105329413] [2020-09-21 10:19:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-21 10:19:47,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105329413] [2020-09-21 10:19:47,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:47,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:19:47,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075987523] [2020-09-21 10:19:47,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:19:47,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:19:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:19:47,874 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2020-09-21 10:19:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:48,005 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-09-21 10:19:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-21 10:19:48,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2020-09-21 10:19:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:48,007 INFO L225 Difference]: With dead ends: 40 [2020-09-21 10:19:48,007 INFO L226 Difference]: Without dead ends: 36 [2020-09-21 10:19:48,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:19:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-21 10:19:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-21 10:19:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-21 10:19:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-09-21 10:19:48,015 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-09-21 10:19:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:48,015 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-09-21 10:19:48,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:19:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-09-21 10:19:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-21 10:19:48,017 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:48,017 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:48,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:19:48,018 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-09-21 10:19:48,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:48,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54066526] [2020-09-21 10:19:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-21 10:19:48,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54066526] [2020-09-21 10:19:48,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:48,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-21 10:19:48,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944118279] [2020-09-21 10:19:48,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-21 10:19:48,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:48,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-21 10:19:48,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:19:48,545 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2020-09-21 10:19:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:48,705 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-21 10:19:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-21 10:19:48,705 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2020-09-21 10:19:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:48,707 INFO L225 Difference]: With dead ends: 43 [2020-09-21 10:19:48,707 INFO L226 Difference]: Without dead ends: 39 [2020-09-21 10:19:48,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:19:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-21 10:19:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-21 10:19:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-21 10:19:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-09-21 10:19:48,714 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-09-21 10:19:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:48,715 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-09-21 10:19:48,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-21 10:19:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-09-21 10:19:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:19:48,716 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:48,717 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:48,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:19:48,717 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-09-21 10:19:48,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:48,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [785035044] [2020-09-21 10:19:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:48,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-21 10:19:49,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [785035044] [2020-09-21 10:19:49,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:49,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-21 10:19:49,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791821390] [2020-09-21 10:19:49,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-21 10:19:49,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:49,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-21 10:19:49,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:19:49,331 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 21 states. [2020-09-21 10:19:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:49,516 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-21 10:19:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-21 10:19:49,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2020-09-21 10:19:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:49,518 INFO L225 Difference]: With dead ends: 46 [2020-09-21 10:19:49,518 INFO L226 Difference]: Without dead ends: 42 [2020-09-21 10:19:49,519 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:19:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-21 10:19:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-21 10:19:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:19:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-21 10:19:49,525 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-09-21 10:19:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:49,526 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-21 10:19:49,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-21 10:19:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-21 10:19:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-21 10:19:49,527 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:49,527 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:49,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:19:49,528 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-09-21 10:19:49,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:49,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155918827] [2020-09-21 10:19:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:49,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-21 10:19:50,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155918827] [2020-09-21 10:19:50,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:50,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-21 10:19:50,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044756109] [2020-09-21 10:19:50,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-21 10:19:50,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-21 10:19:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:19:50,220 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 23 states. [2020-09-21 10:19:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:50,446 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-21 10:19:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-21 10:19:50,446 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2020-09-21 10:19:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:50,447 INFO L225 Difference]: With dead ends: 49 [2020-09-21 10:19:50,448 INFO L226 Difference]: Without dead ends: 45 [2020-09-21 10:19:50,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-09-21 10:19:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-21 10:19:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-21 10:19:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-21 10:19:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-21 10:19:50,455 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-09-21 10:19:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:50,455 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-21 10:19:50,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-21 10:19:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-21 10:19:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-21 10:19:50,457 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:50,457 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:50,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:19:50,457 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-09-21 10:19:50,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:50,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012069122] [2020-09-21 10:19:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:50,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-21 10:19:51,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012069122] [2020-09-21 10:19:51,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:51,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-21 10:19:51,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875894099] [2020-09-21 10:19:51,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-21 10:19:51,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-21 10:19:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:19:51,234 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 25 states. [2020-09-21 10:19:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:51,561 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-09-21 10:19:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-21 10:19:51,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2020-09-21 10:19:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:51,564 INFO L225 Difference]: With dead ends: 52 [2020-09-21 10:19:51,564 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:19:51,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-09-21 10:19:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:19:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-21 10:19:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-21 10:19:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-21 10:19:51,572 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-09-21 10:19:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:51,573 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-21 10:19:51,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-21 10:19:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-21 10:19:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-21 10:19:51,575 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:51,575 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:51,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:19:51,576 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-09-21 10:19:51,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:51,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58517361] [2020-09-21 10:19:51,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:51,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-21 10:19:52,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58517361] [2020-09-21 10:19:52,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:52,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-21 10:19:52,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36464093] [2020-09-21 10:19:52,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-21 10:19:52,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-21 10:19:52,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:19:52,513 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 27 states. [2020-09-21 10:19:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:52,826 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-09-21 10:19:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-21 10:19:52,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2020-09-21 10:19:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:52,827 INFO L225 Difference]: With dead ends: 55 [2020-09-21 10:19:52,827 INFO L226 Difference]: Without dead ends: 51 [2020-09-21 10:19:52,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:19:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-09-21 10:19:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-09-21 10:19:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-09-21 10:19:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-09-21 10:19:52,835 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-09-21 10:19:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:52,835 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-09-21 10:19:52,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-21 10:19:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-09-21 10:19:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-21 10:19:52,836 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:52,836 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:52,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:19:52,837 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-09-21 10:19:52,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:52,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112984071] [2020-09-21 10:19:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:52,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-21 10:19:53,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112984071] [2020-09-21 10:19:53,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:53,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-09-21 10:19:53,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982251174] [2020-09-21 10:19:53,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-21 10:19:53,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-21 10:19:53,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-09-21 10:19:53,881 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 29 states. [2020-09-21 10:19:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:54,287 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-09-21 10:19:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-21 10:19:54,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2020-09-21 10:19:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:54,289 INFO L225 Difference]: With dead ends: 58 [2020-09-21 10:19:54,289 INFO L226 Difference]: Without dead ends: 54 [2020-09-21 10:19:54,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-09-21 10:19:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-21 10:19:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-21 10:19:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-21 10:19:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-09-21 10:19:54,303 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-09-21 10:19:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:54,303 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-09-21 10:19:54,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-21 10:19:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-09-21 10:19:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-21 10:19:54,306 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:54,306 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:54,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:19:54,307 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-09-21 10:19:54,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:54,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [134723862] [2020-09-21 10:19:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:54,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-21 10:19:55,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [134723862] [2020-09-21 10:19:55,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:55,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-09-21 10:19:55,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390418937] [2020-09-21 10:19:55,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-09-21 10:19:55,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:55,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-09-21 10:19:55,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2020-09-21 10:19:55,467 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 31 states. [2020-09-21 10:19:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:55,874 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-21 10:19:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-09-21 10:19:55,875 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 91 [2020-09-21 10:19:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:55,877 INFO L225 Difference]: With dead ends: 61 [2020-09-21 10:19:55,877 INFO L226 Difference]: Without dead ends: 57 [2020-09-21 10:19:55,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2020-09-21 10:19:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-21 10:19:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-09-21 10:19:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-21 10:19:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-09-21 10:19:55,885 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-09-21 10:19:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:55,885 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-09-21 10:19:55,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-09-21 10:19:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-09-21 10:19:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 10:19:55,887 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:55,887 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:55,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:19:55,887 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-09-21 10:19:55,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:55,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1487570517] [2020-09-21 10:19:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:55,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:56,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-21 10:19:57,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1487570517] [2020-09-21 10:19:57,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:57,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-09-21 10:19:57,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629398526] [2020-09-21 10:19:57,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-09-21 10:19:57,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-09-21 10:19:57,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2020-09-21 10:19:57,248 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 33 states. [2020-09-21 10:19:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:57,799 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-21 10:19:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-21 10:19:57,800 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 97 [2020-09-21 10:19:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:57,801 INFO L225 Difference]: With dead ends: 64 [2020-09-21 10:19:57,801 INFO L226 Difference]: Without dead ends: 60 [2020-09-21 10:19:57,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2020-09-21 10:19:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-21 10:19:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-21 10:19:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-21 10:19:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-21 10:19:57,808 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-09-21 10:19:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:57,809 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-21 10:19:57,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-09-21 10:19:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-21 10:19:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-21 10:19:57,810 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:57,810 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:57,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:19:57,810 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-09-21 10:19:57,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:57,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370580474] [2020-09-21 10:19:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:57,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:58,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-21 10:19:59,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370580474] [2020-09-21 10:19:59,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:59,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2020-09-21 10:19:59,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029163122] [2020-09-21 10:19:59,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-09-21 10:19:59,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-09-21 10:19:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-09-21 10:19:59,249 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 35 states. [2020-09-21 10:19:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:59,826 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-09-21 10:19:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-09-21 10:19:59,827 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 103 [2020-09-21 10:19:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:59,832 INFO L225 Difference]: With dead ends: 67 [2020-09-21 10:19:59,832 INFO L226 Difference]: Without dead ends: 63 [2020-09-21 10:19:59,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-09-21 10:19:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-21 10:19:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-21 10:19:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-21 10:19:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-21 10:19:59,843 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-09-21 10:19:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:59,848 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-21 10:19:59,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-09-21 10:19:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-21 10:19:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-21 10:19:59,850 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:59,850 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:59,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:19:59,851 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2020-09-21 10:19:59,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:59,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [994551433] [2020-09-21 10:19:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:59,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:00,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-21 10:20:01,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [994551433] [2020-09-21 10:20:01,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:01,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2020-09-21 10:20:01,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461116100] [2020-09-21 10:20:01,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-09-21 10:20:01,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:01,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-09-21 10:20:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-09-21 10:20:01,451 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 37 states. [2020-09-21 10:20:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:02,185 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-09-21 10:20:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-09-21 10:20:02,190 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2020-09-21 10:20:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:02,191 INFO L225 Difference]: With dead ends: 70 [2020-09-21 10:20:02,191 INFO L226 Difference]: Without dead ends: 66 [2020-09-21 10:20:02,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-09-21 10:20:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-21 10:20:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-09-21 10:20:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-21 10:20:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-09-21 10:20:02,204 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-09-21 10:20:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:02,204 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-09-21 10:20:02,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-09-21 10:20:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-09-21 10:20:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-21 10:20:02,206 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:02,206 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:02,206 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-21 10:20:02,207 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:02,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2020-09-21 10:20:02,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:02,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519402234] [2020-09-21 10:20:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:02,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:03,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-21 10:20:04,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519402234] [2020-09-21 10:20:04,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:04,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2020-09-21 10:20:04,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232011800] [2020-09-21 10:20:04,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-09-21 10:20:04,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-09-21 10:20:04,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-09-21 10:20:04,060 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 39 states. [2020-09-21 10:20:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:04,896 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-09-21 10:20:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-09-21 10:20:04,897 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2020-09-21 10:20:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:04,899 INFO L225 Difference]: With dead ends: 73 [2020-09-21 10:20:04,899 INFO L226 Difference]: Without dead ends: 69 [2020-09-21 10:20:04,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-09-21 10:20:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-21 10:20:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-09-21 10:20:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-21 10:20:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-09-21 10:20:04,906 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-09-21 10:20:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:04,907 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-09-21 10:20:04,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-09-21 10:20:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-09-21 10:20:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-21 10:20:04,908 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:04,908 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:04,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-21 10:20:04,909 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2020-09-21 10:20:04,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:04,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334106088] [2020-09-21 10:20:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:05,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-21 10:20:06,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334106088] [2020-09-21 10:20:06,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:06,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-09-21 10:20:06,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151134435] [2020-09-21 10:20:06,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-09-21 10:20:06,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-09-21 10:20:06,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-09-21 10:20:06,921 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 41 states. [2020-09-21 10:20:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:07,804 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-21 10:20:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-09-21 10:20:07,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 121 [2020-09-21 10:20:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:07,807 INFO L225 Difference]: With dead ends: 76 [2020-09-21 10:20:07,807 INFO L226 Difference]: Without dead ends: 72 [2020-09-21 10:20:07,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-09-21 10:20:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-21 10:20:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-09-21 10:20:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-21 10:20:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-09-21 10:20:07,821 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-09-21 10:20:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:07,821 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-09-21 10:20:07,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-09-21 10:20:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-09-21 10:20:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-09-21 10:20:07,825 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:07,825 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:07,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-21 10:20:07,825 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:07,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2020-09-21 10:20:07,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:07,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1972988447] [2020-09-21 10:20:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:20:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:07,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:08,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:20:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-21 10:20:09,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1972988447] [2020-09-21 10:20:09,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:20:09,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2020-09-21 10:20:09,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494521008] [2020-09-21 10:20:09,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-09-21 10:20:09,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:09,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-09-21 10:20:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-09-21 10:20:09,982 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 43 states. [2020-09-21 10:20:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:10,970 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-21 10:20:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-09-21 10:20:10,971 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 127 [2020-09-21 10:20:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:10,973 INFO L225 Difference]: With dead ends: 79 [2020-09-21 10:20:10,974 INFO L226 Difference]: Without dead ends: 75 [2020-09-21 10:20:10,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-09-21 10:20:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-21 10:20:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-21 10:20:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-21 10:20:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-21 10:20:10,982 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-09-21 10:20:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:10,982 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-21 10:20:10,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-09-21 10:20:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-21 10:20:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-21 10:20:10,984 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:10,984 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:10,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-21 10:20:10,985 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:10,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2020-09-21 10:20:10,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:10,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1448193212] [2020-09-21 10:20:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:20:11,106 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:20:11,107 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:20:11,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-21 10:20:11,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:20:11 BoogieIcfgContainer [2020-09-21 10:20:11,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:20:11,149 INFO L168 Benchmark]: Toolchain (without parser) took 27196.91 ms. Allocated memory was 141.0 MB in the beginning and 492.3 MB in the end (delta: 351.3 MB). Free memory was 102.7 MB in the beginning and 444.3 MB in the end (delta: -341.6 MB). Peak memory consumption was 362.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:11,149 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 120.9 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-21 10:20:11,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.15 ms. Allocated memory is still 141.0 MB. Free memory was 102.3 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:11,150 INFO L168 Benchmark]: Boogie Preprocessor took 30.87 ms. Allocated memory is still 141.0 MB. Free memory was 92.6 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-09-21 10:20:11,151 INFO L168 Benchmark]: RCFGBuilder took 357.72 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 90.9 MB in the beginning and 173.1 MB in the end (delta: -82.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:11,152 INFO L168 Benchmark]: TraceAbstraction took 26495.95 ms. Allocated memory was 204.5 MB in the beginning and 492.3 MB in the end (delta: 287.8 MB). Free memory was 173.1 MB in the beginning and 444.3 MB in the end (delta: -271.2 MB). Peak memory consumption was 369.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:11,154 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.20 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 120.9 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 300.15 ms. Allocated memory is still 141.0 MB. Free memory was 102.3 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.87 ms. Allocated memory is still 141.0 MB. Free memory was 92.6 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 357.72 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 90.9 MB in the beginning and 173.1 MB in the end (delta: -82.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26495.95 ms. Allocated memory was 204.5 MB in the beginning and 492.3 MB in the end (delta: 287.8 MB). Free memory was 173.1 MB in the beginning and 444.3 MB in the end (delta: -271.2 MB). Peak memory consumption was 369.9 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] unsigned int input = __VERIFIER_nondet_uint(); [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] unsigned 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: 26.3s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 684 SDtfs, 2 SDslu, 14532 SDs, 0 SdLazy, 8656 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1533 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 465600 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...