/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=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.8 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-22 01:22:53,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 01:22:53,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 01:22:53,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 01:22:53,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 01:22:53,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 01:22:53,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 01:22:53,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 01:22:53,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 01:22:53,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 01:22:53,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 01:22:53,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 01:22:53,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 01:22:53,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 01:22:53,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 01:22:53,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 01:22:53,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 01:22:53,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 01:22:53,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 01:22:53,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 01:22:53,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 01:22:53,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 01:22:53,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 01:22:53,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 01:22:53,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 01:22:53,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 01:22:53,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 01:22:53,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 01:22:53,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 01:22:53,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 01:22:53,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 01:22:53,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 01:22:53,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 01:22:53,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 01:22:53,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 01:22:53,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 01:22:53,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 01:22:53,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 01:22:53,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 01:22:53,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 01:22:53,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 01:22:53,287 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-22 01:22:53,337 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 01:22:53,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 01:22:53,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 01:22:53,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 01:22:53,341 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 01:22:53,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 01:22:53,341 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 01:22:53,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 01:22:53,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 01:22:53,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 01:22:53,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 01:22:53,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 01:22:53,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 01:22:53,344 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 01:22:53,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 01:22:53,345 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 01:22:53,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 01:22:53,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 01:22:53,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 01:22:53,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 01:22:53,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 01:22:53,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 01:22:53,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 01:22:53,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 01:22:53,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 01:22:53,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 01:22:53,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 01:22:53,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 01:22:53,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 01:22:53,347 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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;log-additional-information=true; [2020-08-22 01:22:53,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 01:22:53,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 01:22:53,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 01:22:53,746 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 01:22:53,746 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 01:22:53,747 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 01:22:53,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80bf51935/48342445c60f4dc58aa5ac9eee76371a/FLAGfe18ccf18 [2020-08-22 01:22:54,276 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 01:22:54,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 01:22:54,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80bf51935/48342445c60f4dc58aa5ac9eee76371a/FLAGfe18ccf18 [2020-08-22 01:22:54,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80bf51935/48342445c60f4dc58aa5ac9eee76371a [2020-08-22 01:22:54,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 01:22:54,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 01:22:54,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 01:22:54,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 01:22:54,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 01:22:54,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:54,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51800d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54, skipping insertion in model container [2020-08-22 01:22:54,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:54,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 01:22:54,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 01:22:54,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 01:22:54,910 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 01:22:54,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 01:22:54,937 INFO L208 MainTranslator]: Completed translation [2020-08-22 01:22:54,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54 WrapperNode [2020-08-22 01:22:54,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 01:22:54,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 01:22:54,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 01:22:54,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 01:22:54,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:54,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:55,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:55,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:55,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:55,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:55,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... [2020-08-22 01:22:55,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 01:22:55,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 01:22:55,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 01:22:55,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 01:22:55,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 01:22:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 01:22:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 01:22:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 01:22:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 01:22:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 01:22:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 01:22:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 01:22:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 01:22:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 01:22:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 01:22:55,283 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 01:22:55,284 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 01:22:55,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 01:22:55 BoogieIcfgContainer [2020-08-22 01:22:55,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 01:22:55,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 01:22:55,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 01:22:55,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 01:22:55,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 01:22:54" (1/3) ... [2020-08-22 01:22:55,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69711785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 01:22:55, skipping insertion in model container [2020-08-22 01:22:55,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 01:22:54" (2/3) ... [2020-08-22 01:22:55,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69711785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 01:22:55, skipping insertion in model container [2020-08-22 01:22:55,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 01:22:55" (3/3) ... [2020-08-22 01:22:55,297 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 01:22:55,310 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 01:22:55,318 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 01:22:55,336 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 01:22:55,386 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 01:22:55,386 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 01:22:55,386 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 01:22:55,386 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 01:22:55,389 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 01:22:55,389 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 01:22:55,389 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 01:22:55,389 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 01:22:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-22 01:22:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 01:22:55,423 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:55,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:55,425 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-22 01:22:55,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:55,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106086384] [2020-08-22 01:22:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:55,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:55,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:55,741 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-22 01:22:55,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106086384] [2020-08-22 01:22:55,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 01:22:55,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 01:22:55,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388204404] [2020-08-22 01:22:55,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 01:22:55,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 01:22:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 01:22:55,776 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-22 01:22:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:55,897 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 01:22:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 01:22:55,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 01:22:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:55,911 INFO L225 Difference]: With dead ends: 35 [2020-08-22 01:22:55,911 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 01:22:55,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 01:22:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 01:22:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 01:22:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 01:22:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 01:22:55,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 01:22:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:55,966 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 01:22:55,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 01:22:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 01:22:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 01:22:55,968 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:55,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:55,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 01:22:55,969 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-22 01:22:55,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:55,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2030794257] [2020-08-22 01:22:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,036 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-22 01:22:56,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2030794257] [2020-08-22 01:22:56,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 01:22:56,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 01:22:56,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803307189] [2020-08-22 01:22:56,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 01:22:56,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 01:22:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 01:22:56,041 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 01:22:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:56,103 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 01:22:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 01:22:56,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 01:22:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:56,105 INFO L225 Difference]: With dead ends: 27 [2020-08-22 01:22:56,106 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 01:22:56,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 01:22:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 01:22:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 01:22:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 01:22:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 01:22:56,115 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 01:22:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:56,115 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 01:22:56,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 01:22:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 01:22:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 01:22:56,117 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:56,118 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:56,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 01:22:56,118 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:56,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-22 01:22:56,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:56,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696231389] [2020-08-22 01:22:56,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 01:22:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 01:22:56,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696231389] [2020-08-22 01:22:56,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:22:56,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 01:22:56,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025485113] [2020-08-22 01:22:56,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 01:22:56,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:56,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 01:22:56,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 01:22:56,222 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-22 01:22:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:56,301 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 01:22:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 01:22:56,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-22 01:22:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:56,303 INFO L225 Difference]: With dead ends: 38 [2020-08-22 01:22:56,304 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 01:22:56,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-22 01:22:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 01:22:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 01:22:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 01:22:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 01:22:56,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 01:22:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:56,313 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 01:22:56,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 01:22:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 01:22:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 01:22:56,315 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:56,315 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:56,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 01:22:56,316 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:56,316 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-22 01:22:56,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:56,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060293462] [2020-08-22 01:22:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 01:22:56,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060293462] [2020-08-22 01:22:56,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:22:56,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 01:22:56,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931057021] [2020-08-22 01:22:56,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 01:22:56,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 01:22:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 01:22:56,479 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-22 01:22:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:56,587 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 01:22:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 01:22:56,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 01:22:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:56,590 INFO L225 Difference]: With dead ends: 41 [2020-08-22 01:22:56,590 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 01:22:56,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-22 01:22:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 01:22:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 01:22:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 01:22:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 01:22:56,604 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 01:22:56,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:56,605 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 01:22:56,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 01:22:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 01:22:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 01:22:56,608 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:56,608 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:56,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 01:22:56,610 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-22 01:22:56,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:56,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1917191299] [2020-08-22 01:22:56,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 01:22:56,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1917191299] [2020-08-22 01:22:56,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:22:56,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 01:22:56,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581882789] [2020-08-22 01:22:56,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 01:22:56,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 01:22:56,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 01:22:56,791 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-22 01:22:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:56,920 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-22 01:22:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 01:22:56,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-22 01:22:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:56,926 INFO L225 Difference]: With dead ends: 76 [2020-08-22 01:22:56,926 INFO L226 Difference]: Without dead ends: 45 [2020-08-22 01:22:56,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 01:22:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-22 01:22:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-22 01:22:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-22 01:22:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-22 01:22:56,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-22 01:22:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:56,958 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-22 01:22:56,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 01:22:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-22 01:22:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-22 01:22:56,964 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:56,965 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:56,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 01:22:56,965 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:56,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-22 01:22:56,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:56,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074362303] [2020-08-22 01:22:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 01:22:57,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074362303] [2020-08-22 01:22:57,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:22:57,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 01:22:57,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165323854] [2020-08-22 01:22:57,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 01:22:57,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:57,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 01:22:57,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 01:22:57,145 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-22 01:22:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:57,273 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-22 01:22:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 01:22:57,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-22 01:22:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:57,276 INFO L225 Difference]: With dead ends: 62 [2020-08-22 01:22:57,276 INFO L226 Difference]: Without dead ends: 58 [2020-08-22 01:22:57,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 01:22:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-22 01:22:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-22 01:22:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-22 01:22:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-22 01:22:57,292 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-22 01:22:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:57,292 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-22 01:22:57,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 01:22:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-22 01:22:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-22 01:22:57,297 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:57,297 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:57,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 01:22:57,298 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-22 01:22:57,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:57,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2842700] [2020-08-22 01:22:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:22:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:22:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-22 01:22:57,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2842700] [2020-08-22 01:22:57,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:22:57,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 01:22:57,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803303178] [2020-08-22 01:22:57,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 01:22:57,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 01:22:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 01:22:57,656 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-22 01:22:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:57,853 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-22 01:22:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 01:22:57,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-22 01:22:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:57,857 INFO L225 Difference]: With dead ends: 97 [2020-08-22 01:22:57,858 INFO L226 Difference]: Without dead ends: 93 [2020-08-22 01:22:57,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-22 01:22:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-22 01:22:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-22 01:22:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-22 01:22:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-22 01:22:57,879 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-22 01:22:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:57,880 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-22 01:22:57,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 01:22:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-22 01:22:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 01:22:57,884 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:57,885 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:57,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 01:22:57,885 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-22 01:22:57,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:57,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942707423] [2020-08-22 01:22:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:57,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:22:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:22:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:22:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:22:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-22 01:22:58,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942707423] [2020-08-22 01:22:58,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:22:58,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 01:22:58,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000811785] [2020-08-22 01:22:58,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 01:22:58,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 01:22:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 01:22:58,552 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-22 01:22:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:59,093 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-22 01:22:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 01:22:59,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-22 01:22:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:59,096 INFO L225 Difference]: With dead ends: 153 [2020-08-22 01:22:59,096 INFO L226 Difference]: Without dead ends: 71 [2020-08-22 01:22:59,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-22 01:22:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-22 01:22:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-22 01:22:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 01:22:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-22 01:22:59,108 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-22 01:22:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:59,109 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-22 01:22:59,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 01:22:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-22 01:22:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 01:22:59,111 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:59,111 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:59,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 01:22:59,112 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-22 01:22:59,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:59,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [63809590] [2020-08-22 01:22:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:22:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:22:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-22 01:22:59,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [63809590] [2020-08-22 01:22:59,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:22:59,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 01:22:59,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154566223] [2020-08-22 01:22:59,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 01:22:59,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:22:59,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 01:22:59,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 01:22:59,409 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-22 01:22:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:22:59,589 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-22 01:22:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 01:22:59,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-22 01:22:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:22:59,591 INFO L225 Difference]: With dead ends: 68 [2020-08-22 01:22:59,591 INFO L226 Difference]: Without dead ends: 64 [2020-08-22 01:22:59,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-22 01:22:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-22 01:22:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-22 01:22:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-22 01:22:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-22 01:22:59,600 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-22 01:22:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:22:59,601 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-22 01:22:59,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 01:22:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-22 01:22:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 01:22:59,604 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:22:59,604 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:22:59,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 01:22:59,604 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:22:59,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:22:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-22 01:22:59,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:22:59,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [500584080] [2020-08-22 01:22:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:22:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:22:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:22:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:22:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:22:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 01:22:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:22:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:22:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:22:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:22:59,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:22:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-22 01:23:00,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [500584080] [2020-08-22 01:23:00,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:23:00,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 01:23:00,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225866989] [2020-08-22 01:23:00,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 01:23:00,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:23:00,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 01:23:00,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 01:23:00,014 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-22 01:23:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:23:00,246 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-22 01:23:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 01:23:00,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-22 01:23:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:23:00,250 INFO L225 Difference]: With dead ends: 180 [2020-08-22 01:23:00,250 INFO L226 Difference]: Without dead ends: 176 [2020-08-22 01:23:00,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-22 01:23:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-22 01:23:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-22 01:23:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-22 01:23:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-22 01:23:00,272 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-22 01:23:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:23:00,273 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-22 01:23:00,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 01:23:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-22 01:23:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 01:23:00,278 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:23:00,279 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:23:00,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 01:23:00,279 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:23:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:23:00,280 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-22 01:23:00,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:23:00,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831095836] [2020-08-22 01:23:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:23:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:23:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:23:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:23:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 01:23:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 01:23:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:23:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:00,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-22 01:23:01,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831095836] [2020-08-22 01:23:01,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:23:01,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 01:23:01,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656738858] [2020-08-22 01:23:01,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 01:23:01,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:23:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 01:23:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 01:23:01,171 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-22 01:23:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:23:01,502 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-22 01:23:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 01:23:01,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-22 01:23:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:23:01,511 INFO L225 Difference]: With dead ends: 410 [2020-08-22 01:23:01,511 INFO L226 Difference]: Without dead ends: 406 [2020-08-22 01:23:01,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-22 01:23:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-22 01:23:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-22 01:23:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-22 01:23:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-22 01:23:01,573 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-22 01:23:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:23:01,574 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-22 01:23:01,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 01:23:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-22 01:23:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-22 01:23:01,589 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:23:01,589 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:23:01,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 01:23:01,590 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:23:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:23:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-22 01:23:01,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:23:01,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1360573335] [2020-08-22 01:23:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:23:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:01,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 01:23:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:01,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 01:23:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:23:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 01:23:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 01:23:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:23:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 01:23:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:02,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 01:23:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 01:23:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 01:23:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 01:23:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 01:23:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 01:23:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 01:23:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 01:23:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-22 01:23:03,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1360573335] [2020-08-22 01:23:03,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 01:23:03,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-22 01:23:03,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855944193] [2020-08-22 01:23:03,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 01:23:03,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 01:23:03,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 01:23:03,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-22 01:23:03,681 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-22 01:23:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 01:23:04,731 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-22 01:23:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 01:23:04,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-22 01:23:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 01:23:04,735 INFO L225 Difference]: With dead ends: 531 [2020-08-22 01:23:04,735 INFO L226 Difference]: Without dead ends: 148 [2020-08-22 01:23:04,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-22 01:23:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-22 01:23:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-22 01:23:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-22 01:23:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-22 01:23:04,757 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-22 01:23:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 01:23:04,758 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-22 01:23:04,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 01:23:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-22 01:23:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-22 01:23:04,767 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 01:23:04,767 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 01:23:04,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 01:23:04,768 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 01:23:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 01:23:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-22 01:23:04,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 01:23:04,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570335824] [2020-08-22 01:23:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 01:23:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 01:23:04,873 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 01:23:04,873 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 01:23:04,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 01:23:04,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 01:23:04 BoogieIcfgContainer [2020-08-22 01:23:04,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 01:23:04,974 INFO L168 Benchmark]: Toolchain (without parser) took 10264.10 ms. Allocated memory was 133.2 MB in the beginning and 555.7 MB in the end (delta: 422.6 MB). Free memory was 94.8 MB in the beginning and 373.5 MB in the end (delta: -278.7 MB). Peak memory consumption was 143.9 MB. Max. memory is 7.1 GB. [2020-08-22 01:23:04,976 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 133.2 MB. Free memory was 113.5 MB in the beginning and 113.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-22 01:23:04,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.90 ms. Allocated memory is still 133.2 MB. Free memory was 94.6 MB in the beginning and 85.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-08-22 01:23:04,977 INFO L168 Benchmark]: Boogie Preprocessor took 92.27 ms. Allocated memory was 133.2 MB in the beginning and 197.1 MB in the end (delta: 64.0 MB). Free memory was 85.2 MB in the beginning and 176.0 MB in the end (delta: -90.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-08-22 01:23:04,978 INFO L168 Benchmark]: RCFGBuilder took 257.63 ms. Allocated memory is still 197.1 MB. Free memory was 176.0 MB in the beginning and 163.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-08-22 01:23:04,983 INFO L168 Benchmark]: TraceAbstraction took 9676.64 ms. Allocated memory was 197.1 MB in the beginning and 555.7 MB in the end (delta: 358.6 MB). Free memory was 162.6 MB in the beginning and 373.5 MB in the end (delta: -210.9 MB). Peak memory consumption was 147.7 MB. Max. memory is 7.1 GB. [2020-08-22 01:23:04,992 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.19 ms. Allocated memory is still 133.2 MB. Free memory was 113.5 MB in the beginning and 113.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 231.90 ms. Allocated memory is still 133.2 MB. Free memory was 94.6 MB in the beginning and 85.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.27 ms. Allocated memory was 133.2 MB in the beginning and 197.1 MB in the end (delta: 64.0 MB). Free memory was 85.2 MB in the beginning and 176.0 MB in the end (delta: -90.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 257.63 ms. Allocated memory is still 197.1 MB. Free memory was 176.0 MB in the beginning and 163.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9676.64 ms. Allocated memory was 197.1 MB in the beginning and 555.7 MB in the end (delta: 358.6 MB). Free memory was 162.6 MB in the beginning and 373.5 MB in the end (delta: -210.9 MB). Peak memory consumption was 147.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1353 SolverSat, 481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 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...