/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 true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.1 -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-5644d1e-m [2020-08-19 03:34:21,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 03:34:21,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 03:34:21,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 03:34:21,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 03:34:21,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 03:34:21,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 03:34:21,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 03:34:21,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 03:34:21,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 03:34:21,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 03:34:21,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 03:34:21,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 03:34:21,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 03:34:21,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 03:34:21,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 03:34:21,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 03:34:21,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 03:34:21,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 03:34:21,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 03:34:21,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 03:34:21,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 03:34:21,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 03:34:21,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 03:34:21,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 03:34:21,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 03:34:21,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 03:34:21,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 03:34:21,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 03:34:21,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 03:34:21,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 03:34:21,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 03:34:21,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 03:34:21,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 03:34:21,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 03:34:21,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 03:34:21,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 03:34:21,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 03:34:21,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 03:34:21,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 03:34:21,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 03:34:21,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 03:34:21,347 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 03:34:21,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 03:34:21,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 03:34:21,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 03:34:21,354 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 03:34:21,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 03:34:21,354 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 03:34:21,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 03:34:21,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 03:34:21,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 03:34:21,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 03:34:21,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 03:34:21,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 03:34:21,355 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 03:34:21,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 03:34:21,357 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 03:34:21,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 03:34:21,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 03:34:21,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 03:34:21,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 03:34:21,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 03:34:21,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 03:34:21,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 03:34:21,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 03:34:21,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 03:34:21,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 03:34:21,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 03:34:21,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 03:34:21,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 03:34:21,360 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; [2020-08-19 03:34:21,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 03:34:21,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 03:34:21,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 03:34:21,721 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 03:34:21,722 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 03:34:21,723 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-08-19 03:34:21,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e64274d91/02abcdbfaaea42d9994f3296e5b0b04f/FLAG2ea053515 [2020-08-19 03:34:22,247 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 03:34:22,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_o20.c [2020-08-19 03:34:22,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e64274d91/02abcdbfaaea42d9994f3296e5b0b04f/FLAG2ea053515 [2020-08-19 03:34:22,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e64274d91/02abcdbfaaea42d9994f3296e5b0b04f [2020-08-19 03:34:22,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 03:34:22,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 03:34:22,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 03:34:22,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 03:34:22,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 03:34:22,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b7bdc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22, skipping insertion in model container [2020-08-19 03:34:22,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 03:34:22,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 03:34:22,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 03:34:22,828 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 03:34:22,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 03:34:22,852 INFO L208 MainTranslator]: Completed translation [2020-08-19 03:34:22,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22 WrapperNode [2020-08-19 03:34:22,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 03:34:22,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 03:34:22,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 03:34:22,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 03:34:22,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... [2020-08-19 03:34:22,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 03:34:22,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 03:34:22,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 03:34:22,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 03:34:22,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 03:34:23,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 03:34:23,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 03:34:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-19 03:34:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 03:34:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-08-19 03:34:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 03:34:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-19 03:34:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 03:34:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 03:34:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 03:34:23,180 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 03:34:23,180 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 03:34:23,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 03:34:23 BoogieIcfgContainer [2020-08-19 03:34:23,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 03:34:23,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 03:34:23,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 03:34:23,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 03:34:23,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 03:34:22" (1/3) ... [2020-08-19 03:34:23,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5700c1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 03:34:23, skipping insertion in model container [2020-08-19 03:34:23,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:34:22" (2/3) ... [2020-08-19 03:34:23,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5700c1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 03:34:23, skipping insertion in model container [2020-08-19 03:34:23,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 03:34:23" (3/3) ... [2020-08-19 03:34:23,193 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o20.c [2020-08-19 03:34:23,204 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 03:34:23,211 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 03:34:23,224 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 03:34:23,250 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 03:34:23,250 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 03:34:23,250 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 03:34:23,250 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 03:34:23,250 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 03:34:23,251 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 03:34:23,251 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 03:34:23,251 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 03:34:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-19 03:34:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 03:34:23,275 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:23,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:23,276 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:23,282 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-08-19 03:34:23,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:23,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1513527970] [2020-08-19 03:34:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:23,604 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2020-08-19 03:34:23,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:23,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:34:23,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1513527970] [2020-08-19 03:34:23,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 03:34:23,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 03:34:23,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889261261] [2020-08-19 03:34:23,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 03:34:23,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 03:34:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 03:34:23,715 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-19 03:34:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:23,771 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-08-19 03:34:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 03:34:23,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 03:34:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:23,782 INFO L225 Difference]: With dead ends: 32 [2020-08-19 03:34:23,782 INFO L226 Difference]: Without dead ends: 18 [2020-08-19 03:34:23,786 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-08-19 03:34:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-19 03:34:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-19 03:34:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-19 03:34:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-19 03:34:23,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-19 03:34:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:23,829 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-19 03:34:23,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 03:34:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-19 03:34:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-19 03:34:23,832 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:23,832 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:23,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 03:34:23,833 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:23,833 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-08-19 03:34:23,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:23,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691866392] [2020-08-19 03:34:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:23,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:23,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-19 03:34:24,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691866392] [2020-08-19 03:34:24,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:24,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 03:34:24,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173918924] [2020-08-19 03:34:24,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 03:34:24,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:24,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 03:34:24,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-19 03:34:24,062 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2020-08-19 03:34:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:24,092 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-19 03:34:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 03:34:24,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-08-19 03:34:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:24,094 INFO L225 Difference]: With dead ends: 25 [2020-08-19 03:34:24,094 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 03:34:24,096 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-08-19 03:34:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 03:34:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 03:34:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 03:34:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-19 03:34:24,103 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-19 03:34:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:24,104 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-19 03:34:24,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 03:34:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-19 03:34:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-19 03:34:24,106 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:24,106 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:24,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 03:34:24,106 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:24,107 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-08-19 03:34:24,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:24,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1258141922] [2020-08-19 03:34:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-19 03:34:24,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1258141922] [2020-08-19 03:34:24,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:24,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 03:34:24,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151286706] [2020-08-19 03:34:24,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 03:34:24,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:24,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 03:34:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-08-19 03:34:24,377 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2020-08-19 03:34:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:24,426 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-19 03:34:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 03:34:24,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-08-19 03:34:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:24,429 INFO L225 Difference]: With dead ends: 28 [2020-08-19 03:34:24,429 INFO L226 Difference]: Without dead ends: 24 [2020-08-19 03:34:24,432 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-08-19 03:34:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-19 03:34:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-19 03:34:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-19 03:34:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-19 03:34:24,447 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-19 03:34:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:24,449 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-19 03:34:24,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 03:34:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-19 03:34:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-19 03:34:24,451 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:24,451 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:24,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 03:34:24,452 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:24,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-08-19 03:34:24,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:24,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091915875] [2020-08-19 03:34:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-19 03:34:24,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091915875] [2020-08-19 03:34:24,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:24,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 03:34:24,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16078230] [2020-08-19 03:34:24,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 03:34:24,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 03:34:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-08-19 03:34:24,819 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2020-08-19 03:34:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:24,878 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-19 03:34:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 03:34:24,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2020-08-19 03:34:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:24,880 INFO L225 Difference]: With dead ends: 31 [2020-08-19 03:34:24,880 INFO L226 Difference]: Without dead ends: 27 [2020-08-19 03:34:24,881 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-08-19 03:34:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-19 03:34:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-19 03:34:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-19 03:34:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-19 03:34:24,888 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-19 03:34:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:24,889 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-19 03:34:24,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 03:34:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-19 03:34:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-19 03:34:24,890 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:24,891 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:24,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 03:34:24,891 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-08-19 03:34:24,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:24,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [818741149] [2020-08-19 03:34:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:24,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-19 03:34:25,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [818741149] [2020-08-19 03:34:25,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:25,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 03:34:25,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894071809] [2020-08-19 03:34:25,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 03:34:25,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:25,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 03:34:25,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-08-19 03:34:25,187 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2020-08-19 03:34:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:25,262 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-19 03:34:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 03:34:25,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-08-19 03:34:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:25,264 INFO L225 Difference]: With dead ends: 34 [2020-08-19 03:34:25,264 INFO L226 Difference]: Without dead ends: 30 [2020-08-19 03:34:25,265 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-08-19 03:34:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-19 03:34:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-19 03:34:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 03:34:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-19 03:34:25,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-19 03:34:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:25,273 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-19 03:34:25,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 03:34:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-19 03:34:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-19 03:34:25,275 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:25,275 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:25,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 03:34:25,275 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-08-19 03:34:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:25,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1843248499] [2020-08-19 03:34:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-19 03:34:25,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1843248499] [2020-08-19 03:34:25,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:25,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-19 03:34:25,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317448342] [2020-08-19 03:34:25,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-19 03:34:25,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:25,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-19 03:34:25,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-08-19 03:34:25,600 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2020-08-19 03:34:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:25,703 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-19 03:34:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 03:34:25,704 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2020-08-19 03:34:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:25,705 INFO L225 Difference]: With dead ends: 37 [2020-08-19 03:34:25,705 INFO L226 Difference]: Without dead ends: 33 [2020-08-19 03:34:25,706 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-08-19 03:34:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-19 03:34:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-19 03:34:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-19 03:34:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-19 03:34:25,712 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-19 03:34:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:25,713 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-19 03:34:25,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-19 03:34:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-19 03:34:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-19 03:34:25,715 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:25,715 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:25,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 03:34:25,715 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-08-19 03:34:25,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:25,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1450546922] [2020-08-19 03:34:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:25,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-19 03:34:26,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1450546922] [2020-08-19 03:34:26,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:26,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 03:34:26,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202227599] [2020-08-19 03:34:26,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 03:34:26,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 03:34:26,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-08-19 03:34:26,072 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2020-08-19 03:34:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:26,209 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-19 03:34:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-19 03:34:26,209 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2020-08-19 03:34:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:26,211 INFO L225 Difference]: With dead ends: 40 [2020-08-19 03:34:26,211 INFO L226 Difference]: Without dead ends: 36 [2020-08-19 03:34:26,212 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-08-19 03:34:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-19 03:34:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-19 03:34:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-19 03:34:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-19 03:34:26,218 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-19 03:34:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:26,219 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-19 03:34:26,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 03:34:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-19 03:34:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-19 03:34:26,220 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:26,220 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:26,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 03:34:26,221 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-08-19 03:34:26,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:26,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1235049733] [2020-08-19 03:34:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-19 03:34:26,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1235049733] [2020-08-19 03:34:26,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:26,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-19 03:34:26,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186002651] [2020-08-19 03:34:26,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-19 03:34:26,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-19 03:34:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-08-19 03:34:26,676 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2020-08-19 03:34:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:26,812 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-19 03:34:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 03:34:26,812 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2020-08-19 03:34:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:26,814 INFO L225 Difference]: With dead ends: 43 [2020-08-19 03:34:26,814 INFO L226 Difference]: Without dead ends: 39 [2020-08-19 03:34:26,815 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-08-19 03:34:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-19 03:34:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-19 03:34:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 03:34:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-19 03:34:26,821 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-19 03:34:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:26,822 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-19 03:34:26,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-19 03:34:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-19 03:34:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-19 03:34:26,824 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:26,824 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:26,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 03:34:26,824 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-08-19 03:34:26,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:26,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399145722] [2020-08-19 03:34:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:26,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-19 03:34:27,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399145722] [2020-08-19 03:34:27,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:27,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-19 03:34:27,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488491912] [2020-08-19 03:34:27,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-19 03:34:27,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:27,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-19 03:34:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-08-19 03:34:27,332 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 21 states. [2020-08-19 03:34:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:27,494 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-19 03:34:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 03:34:27,494 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2020-08-19 03:34:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:27,498 INFO L225 Difference]: With dead ends: 46 [2020-08-19 03:34:27,498 INFO L226 Difference]: Without dead ends: 42 [2020-08-19 03:34:27,500 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-08-19 03:34:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-19 03:34:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-19 03:34:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-19 03:34:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-19 03:34:27,510 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-19 03:34:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:27,510 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-19 03:34:27,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-19 03:34:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-19 03:34:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-19 03:34:27,513 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:27,513 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:27,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 03:34:27,514 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-08-19 03:34:27,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:27,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642656589] [2020-08-19 03:34:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:27,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-19 03:34:28,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642656589] [2020-08-19 03:34:28,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:28,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-19 03:34:28,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474859589] [2020-08-19 03:34:28,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-19 03:34:28,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-19 03:34:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-08-19 03:34:28,249 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 23 states. [2020-08-19 03:34:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:28,542 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-19 03:34:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-19 03:34:28,543 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2020-08-19 03:34:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:28,545 INFO L225 Difference]: With dead ends: 49 [2020-08-19 03:34:28,545 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 03:34:28,546 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-08-19 03:34:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 03:34:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-19 03:34:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-19 03:34:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-19 03:34:28,559 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-19 03:34:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:28,559 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-19 03:34:28,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-19 03:34:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-19 03:34:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-19 03:34:28,567 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:28,568 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:28,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 03:34:28,568 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:28,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-08-19 03:34:28,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:28,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [182836507] [2020-08-19 03:34:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:28,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-19 03:34:29,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [182836507] [2020-08-19 03:34:29,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:29,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-08-19 03:34:29,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053266778] [2020-08-19 03:34:29,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-08-19 03:34:29,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-08-19 03:34:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-08-19 03:34:29,510 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 25 states. [2020-08-19 03:34:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:29,768 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-19 03:34:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-08-19 03:34:29,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2020-08-19 03:34:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:29,770 INFO L225 Difference]: With dead ends: 52 [2020-08-19 03:34:29,770 INFO L226 Difference]: Without dead ends: 48 [2020-08-19 03:34:29,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-08-19 03:34:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-19 03:34:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-19 03:34:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-19 03:34:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-19 03:34:29,784 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-19 03:34:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:29,784 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-19 03:34:29,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-08-19 03:34:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-19 03:34:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-19 03:34:29,787 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:29,788 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:29,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 03:34:29,789 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:29,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-08-19 03:34:29,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:29,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280266596] [2020-08-19 03:34:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:29,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-19 03:34:30,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [280266596] [2020-08-19 03:34:30,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:30,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-08-19 03:34:30,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252772920] [2020-08-19 03:34:30,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-08-19 03:34:30,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:30,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-08-19 03:34:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2020-08-19 03:34:30,646 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 27 states. [2020-08-19 03:34:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:30,936 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-19 03:34:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-19 03:34:30,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2020-08-19 03:34:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:30,937 INFO L225 Difference]: With dead ends: 55 [2020-08-19 03:34:30,938 INFO L226 Difference]: Without dead ends: 51 [2020-08-19 03:34:30,939 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-08-19 03:34:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-19 03:34:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-19 03:34:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-19 03:34:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-19 03:34:30,945 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-19 03:34:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:30,945 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-19 03:34:30,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-08-19 03:34:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-19 03:34:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-19 03:34:30,947 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:30,947 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:30,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 03:34:30,947 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-08-19 03:34:30,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:30,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1264814522] [2020-08-19 03:34:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-19 03:34:31,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1264814522] [2020-08-19 03:34:31,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:31,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-08-19 03:34:31,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381778551] [2020-08-19 03:34:31,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-08-19 03:34:31,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-08-19 03:34:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-08-19 03:34:31,897 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 29 states. [2020-08-19 03:34:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:32,224 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-19 03:34:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-19 03:34:32,225 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2020-08-19 03:34:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:32,226 INFO L225 Difference]: With dead ends: 58 [2020-08-19 03:34:32,226 INFO L226 Difference]: Without dead ends: 54 [2020-08-19 03:34:32,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-08-19 03:34:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-19 03:34:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-19 03:34:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 03:34:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-19 03:34:32,239 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-19 03:34:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:32,239 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-19 03:34:32,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-08-19 03:34:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-19 03:34:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-19 03:34:32,243 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:32,243 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:32,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 03:34:32,243 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:32,244 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-08-19 03:34:32,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:32,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450764997] [2020-08-19 03:34:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:32,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-19 03:34:33,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450764997] [2020-08-19 03:34:33,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:33,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-08-19 03:34:33,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668946810] [2020-08-19 03:34:33,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-08-19 03:34:33,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:33,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-08-19 03:34:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2020-08-19 03:34:33,349 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 31 states. [2020-08-19 03:34:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:33,701 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-19 03:34:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-08-19 03:34:33,702 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 91 [2020-08-19 03:34:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:33,703 INFO L225 Difference]: With dead ends: 61 [2020-08-19 03:34:33,703 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 03:34:33,704 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-08-19 03:34:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 03:34:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-19 03:34:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-19 03:34:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-19 03:34:33,710 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-19 03:34:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:33,710 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-19 03:34:33,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-08-19 03:34:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-19 03:34:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-19 03:34:33,711 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:33,712 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:33,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 03:34:33,712 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:33,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:33,712 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-08-19 03:34:33,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:33,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1020547635] [2020-08-19 03:34:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:33,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-19 03:34:34,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1020547635] [2020-08-19 03:34:34,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:35,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-08-19 03:34:35,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522254667] [2020-08-19 03:34:35,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-08-19 03:34:35,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-08-19 03:34:35,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2020-08-19 03:34:35,004 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 33 states. [2020-08-19 03:34:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:35,420 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-19 03:34:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-08-19 03:34:35,420 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 97 [2020-08-19 03:34:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:35,421 INFO L225 Difference]: With dead ends: 64 [2020-08-19 03:34:35,421 INFO L226 Difference]: Without dead ends: 60 [2020-08-19 03:34:35,422 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-08-19 03:34:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-19 03:34:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-19 03:34:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-19 03:34:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-19 03:34:35,433 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-19 03:34:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:35,433 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-19 03:34:35,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-08-19 03:34:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-19 03:34:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-19 03:34:35,438 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:35,438 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:35,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 03:34:35,438 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-08-19 03:34:35,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:35,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [469473194] [2020-08-19 03:34:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:35,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-08-19 03:34:36,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [469473194] [2020-08-19 03:34:36,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:36,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2020-08-19 03:34:36,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986130665] [2020-08-19 03:34:36,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-08-19 03:34:36,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-08-19 03:34:36,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-08-19 03:34:36,663 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 35 states. [2020-08-19 03:34:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:37,180 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-19 03:34:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-19 03:34:37,181 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 103 [2020-08-19 03:34:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:37,183 INFO L225 Difference]: With dead ends: 67 [2020-08-19 03:34:37,183 INFO L226 Difference]: Without dead ends: 63 [2020-08-19 03:34:37,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-08-19 03:34:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-19 03:34:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-19 03:34:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-19 03:34:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-19 03:34:37,196 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-19 03:34:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:37,197 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-19 03:34:37,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-08-19 03:34:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-19 03:34:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 03:34:37,198 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:37,199 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:37,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 03:34:37,199 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2020-08-19 03:34:37,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:37,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089204094] [2020-08-19 03:34:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:37,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:38,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:38,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:38,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:38,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:38,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-19 03:34:38,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089204094] [2020-08-19 03:34:38,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:38,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2020-08-19 03:34:38,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278197419] [2020-08-19 03:34:38,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-08-19 03:34:38,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:38,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-08-19 03:34:38,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-08-19 03:34:38,514 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 37 states. [2020-08-19 03:34:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:39,086 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-08-19 03:34:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-08-19 03:34:39,089 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2020-08-19 03:34:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:39,090 INFO L225 Difference]: With dead ends: 70 [2020-08-19 03:34:39,090 INFO L226 Difference]: Without dead ends: 66 [2020-08-19 03:34:39,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-08-19 03:34:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-19 03:34:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-19 03:34:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-19 03:34:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-08-19 03:34:39,096 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-08-19 03:34:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:39,097 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-08-19 03:34:39,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-08-19 03:34:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-08-19 03:34:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-19 03:34:39,098 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:39,098 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:39,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-19 03:34:39,099 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2020-08-19 03:34:39,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:39,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133057550] [2020-08-19 03:34:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:39,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-08-19 03:34:40,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133057550] [2020-08-19 03:34:40,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:40,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2020-08-19 03:34:40,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117428338] [2020-08-19 03:34:40,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-08-19 03:34:40,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-08-19 03:34:40,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-08-19 03:34:40,743 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 39 states. [2020-08-19 03:34:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:41,396 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-08-19 03:34:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-08-19 03:34:41,396 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2020-08-19 03:34:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:41,397 INFO L225 Difference]: With dead ends: 73 [2020-08-19 03:34:41,397 INFO L226 Difference]: Without dead ends: 69 [2020-08-19 03:34:41,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-08-19 03:34:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-19 03:34:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-19 03:34:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-19 03:34:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-08-19 03:34:41,403 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-08-19 03:34:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:41,403 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-08-19 03:34:41,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-08-19 03:34:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-08-19 03:34:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-19 03:34:41,405 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:41,405 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:41,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-19 03:34:41,405 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:41,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:41,406 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2020-08-19 03:34:41,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:41,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713638957] [2020-08-19 03:34:41,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:41,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:42,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-08-19 03:34:43,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713638957] [2020-08-19 03:34:43,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:43,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-08-19 03:34:43,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357134845] [2020-08-19 03:34:43,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-08-19 03:34:43,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-08-19 03:34:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-08-19 03:34:43,048 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 41 states. [2020-08-19 03:34:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:43,787 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-08-19 03:34:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-19 03:34:43,787 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 121 [2020-08-19 03:34:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:43,789 INFO L225 Difference]: With dead ends: 76 [2020-08-19 03:34:43,789 INFO L226 Difference]: Without dead ends: 72 [2020-08-19 03:34:43,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-08-19 03:34:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-08-19 03:34:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-08-19 03:34:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-19 03:34:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-08-19 03:34:43,795 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-08-19 03:34:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:43,796 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-08-19 03:34:43,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-08-19 03:34:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-08-19 03:34:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-19 03:34:43,797 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:43,797 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:43,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-19 03:34:43,798 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2020-08-19 03:34:43,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:43,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15112435] [2020-08-19 03:34:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:43,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:34:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:43,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:34:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:43,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:43,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:44,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:45,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:45,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:45,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:45,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:45,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 03:34:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:34:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-08-19 03:34:45,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15112435] [2020-08-19 03:34:45,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:34:45,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2020-08-19 03:34:45,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541027077] [2020-08-19 03:34:45,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-08-19 03:34:45,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:34:45,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-08-19 03:34:45,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-08-19 03:34:45,673 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 43 states. [2020-08-19 03:34:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:34:46,489 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-08-19 03:34:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-08-19 03:34:46,490 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 127 [2020-08-19 03:34:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:34:46,491 INFO L225 Difference]: With dead ends: 79 [2020-08-19 03:34:46,491 INFO L226 Difference]: Without dead ends: 75 [2020-08-19 03:34:46,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-08-19 03:34:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-19 03:34:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-08-19 03:34:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-08-19 03:34:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-08-19 03:34:46,498 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-08-19 03:34:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:34:46,498 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-08-19 03:34:46,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-08-19 03:34:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-08-19 03:34:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-19 03:34:46,499 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:34:46,500 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:34:46,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-19 03:34:46,500 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:34:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:34:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2020-08-19 03:34:46,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:34:46,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070711915] [2020-08-19 03:34:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:34:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 03:34:46,584 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 03:34:46,584 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 03:34:46,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-19 03:34:46,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 03:34:46 BoogieIcfgContainer [2020-08-19 03:34:46,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 03:34:46,618 INFO L168 Benchmark]: Toolchain (without parser) took 23996.05 ms. Allocated memory was 138.9 MB in the beginning and 509.1 MB in the end (delta: 370.1 MB). Free memory was 101.1 MB in the beginning and 236.3 MB in the end (delta: -135.2 MB). Peak memory consumption was 234.9 MB. Max. memory is 7.1 GB. [2020-08-19 03:34:46,619 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 03:34:46,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.41 ms. Allocated memory is still 138.9 MB. Free memory was 100.9 MB in the beginning and 91.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-19 03:34:46,620 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 ms. Allocated memory is still 138.9 MB. Free memory was 91.7 MB in the beginning and 90.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-19 03:34:46,621 INFO L168 Benchmark]: RCFGBuilder took 306.59 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 90.3 MB in the beginning and 168.4 MB in the end (delta: -78.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-08-19 03:34:46,622 INFO L168 Benchmark]: TraceAbstraction took 23430.34 ms. Allocated memory was 199.8 MB in the beginning and 509.1 MB in the end (delta: 309.3 MB). Free memory was 167.8 MB in the beginning and 236.3 MB in the end (delta: -68.6 MB). Peak memory consumption was 240.7 MB. Max. memory is 7.1 GB. [2020-08-19 03:34:46,624 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 138.9 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 229.41 ms. Allocated memory is still 138.9 MB. Free memory was 100.9 MB in the beginning and 91.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.48 ms. Allocated memory is still 138.9 MB. Free memory was 91.7 MB in the beginning and 90.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 306.59 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 90.3 MB in the beginning and 168.4 MB in the end (delta: -78.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23430.34 ms. Allocated memory was 199.8 MB in the beginning and 509.1 MB in the end (delta: 309.3 MB). Free memory was 167.8 MB in the beginning and 236.3 MB in the end (delta: -68.6 MB). Peak memory consumption was 240.7 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: 23.3s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 6.1s, 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, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s 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, 15.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...