/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.4 --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-21 23:45:24,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 23:45:24,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 23:45:24,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 23:45:24,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 23:45:24,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 23:45:24,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 23:45:24,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 23:45:24,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 23:45:24,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 23:45:24,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 23:45:24,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 23:45:24,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 23:45:24,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 23:45:24,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 23:45:24,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 23:45:24,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 23:45:24,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 23:45:24,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 23:45:24,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 23:45:24,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 23:45:24,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 23:45:24,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 23:45:24,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 23:45:24,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 23:45:24,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 23:45:24,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 23:45:24,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 23:45:24,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 23:45:24,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 23:45:24,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 23:45:24,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 23:45:24,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 23:45:24,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 23:45:24,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 23:45:24,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 23:45:24,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 23:45:24,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 23:45:24,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 23:45:24,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 23:45:24,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 23:45:24,620 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-21 23:45:24,643 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 23:45:24,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 23:45:24,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 23:45:24,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 23:45:24,645 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 23:45:24,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 23:45:24,646 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 23:45:24,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 23:45:24,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 23:45:24,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 23:45:24,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 23:45:24,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 23:45:24,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 23:45:24,647 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 23:45:24,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 23:45:24,647 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 23:45:24,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 23:45:24,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 23:45:24,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 23:45:24,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 23:45:24,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 23:45:24,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 23:45:24,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 23:45:24,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 23:45:24,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 23:45:24,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 23:45:24,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 23:45:24,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 23:45:24,650 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 23:45:24,650 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.4;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.4;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.4;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.4;log-additional-information=true; [2020-08-21 23:45:24,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 23:45:24,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 23:45:24,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 23:45:25,001 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 23:45:25,001 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 23:45:25,002 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-21 23:45:25,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c60b88f0/4e86e08b8cc44dc4a1fc4421f5380ad4/FLAG04a1bb9a9 [2020-08-21 23:45:25,526 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 23:45:25,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 23:45:25,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c60b88f0/4e86e08b8cc44dc4a1fc4421f5380ad4/FLAG04a1bb9a9 [2020-08-21 23:45:25,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0c60b88f0/4e86e08b8cc44dc4a1fc4421f5380ad4 [2020-08-21 23:45:25,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 23:45:25,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 23:45:25,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 23:45:25,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 23:45:25,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 23:45:25,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:45:25" (1/1) ... [2020-08-21 23:45:25,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be095dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:25, skipping insertion in model container [2020-08-21 23:45:25,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:45:25" (1/1) ... [2020-08-21 23:45:25,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 23:45:25,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 23:45:26,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 23:45:26,147 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 23:45:26,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 23:45:26,176 INFO L208 MainTranslator]: Completed translation [2020-08-21 23:45:26,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26 WrapperNode [2020-08-21 23:45:26,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 23:45:26,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 23:45:26,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 23:45:26,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 23:45:26,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (1/1) ... [2020-08-21 23:45:26,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (1/1) ... [2020-08-21 23:45:26,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (1/1) ... [2020-08-21 23:45:26,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (1/1) ... [2020-08-21 23:45:26,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (1/1) ... [2020-08-21 23:45:26,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (1/1) ... [2020-08-21 23:45:26,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (1/1) ... [2020-08-21 23:45:26,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 23:45:26,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 23:45:26,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 23:45:26,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 23:45:26,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (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-21 23:45:26,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 23:45:26,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 23:45:26,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-21 23:45:26,356 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 23:45:26,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 23:45:26,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 23:45:26,357 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-21 23:45:26,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 23:45:26,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 23:45:26,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 23:45:26,530 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 23:45:26,530 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 23:45:26,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:45:26 BoogieIcfgContainer [2020-08-21 23:45:26,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 23:45:26,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 23:45:26,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 23:45:26,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 23:45:26,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:45:25" (1/3) ... [2020-08-21 23:45:26,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf6c2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:45:26, skipping insertion in model container [2020-08-21 23:45:26,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:45:26" (2/3) ... [2020-08-21 23:45:26,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf6c2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:45:26, skipping insertion in model container [2020-08-21 23:45:26,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:45:26" (3/3) ... [2020-08-21 23:45:26,543 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-21 23:45:26,556 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 23:45:26,564 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 23:45:26,596 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 23:45:26,664 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 23:45:26,665 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 23:45:26,665 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 23:45:26,665 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 23:45:26,665 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 23:45:26,665 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 23:45:26,665 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 23:45:26,666 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 23:45:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-21 23:45:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 23:45:26,694 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:26,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:45:26,695 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-21 23:45:26,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:26,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120254907] [2020-08-21 23:45:26,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:26,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:26,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:26,929 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-21 23:45:26,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120254907] [2020-08-21 23:45:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:45:26,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 23:45:26,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811002359] [2020-08-21 23:45:26,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 23:45:26,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:26,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 23:45:26,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:45:26,955 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-21 23:45:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:27,072 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 23:45:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:45:27,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 23:45:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:27,085 INFO L225 Difference]: With dead ends: 35 [2020-08-21 23:45:27,086 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 23:45:27,089 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-21 23:45:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 23:45:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 23:45:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 23:45:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 23:45:27,138 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 23:45:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:27,138 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 23:45:27,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 23:45:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 23:45:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 23:45:27,141 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:27,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:45:27,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 23:45:27,142 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:27,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-21 23:45:27,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:27,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560396288] [2020-08-21 23:45:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,208 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-21 23:45:27,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560396288] [2020-08-21 23:45:27,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:45:27,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 23:45:27,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830792530] [2020-08-21 23:45:27,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 23:45:27,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:27,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 23:45:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:45:27,215 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 23:45:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:27,278 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 23:45:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:45:27,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 23:45:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:27,281 INFO L225 Difference]: With dead ends: 27 [2020-08-21 23:45:27,281 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 23:45:27,282 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-21 23:45:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 23:45:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 23:45:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 23:45:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 23:45:27,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 23:45:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:27,291 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 23:45:27,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 23:45:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 23:45:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 23:45:27,292 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:27,293 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-21 23:45:27,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 23:45:27,293 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:27,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:27,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-21 23:45:27,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:27,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18478097] [2020-08-21 23:45:27,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 23:45:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,452 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-21 23:45:27,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [18478097] [2020-08-21 23:45:27,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:27,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 23:45:27,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089184965] [2020-08-21 23:45:27,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 23:45:27,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:27,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 23:45:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:45:27,457 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-21 23:45:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:27,567 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 23:45:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 23:45:27,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 23:45:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:27,570 INFO L225 Difference]: With dead ends: 38 [2020-08-21 23:45:27,570 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 23:45:27,571 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-21 23:45:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 23:45:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 23:45:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 23:45:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 23:45:27,579 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 23:45:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:27,580 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 23:45:27,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 23:45:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 23:45:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 23:45:27,582 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:27,582 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-21 23:45:27,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 23:45:27,583 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-21 23:45:27,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:27,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057959369] [2020-08-21 23:45:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,722 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-21 23:45:27,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057959369] [2020-08-21 23:45:27,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:27,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 23:45:27,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123360519] [2020-08-21 23:45:27,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 23:45:27,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 23:45:27,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:45:27,725 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 23:45:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:27,851 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 23:45:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 23:45:27,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 23:45:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:27,854 INFO L225 Difference]: With dead ends: 41 [2020-08-21 23:45:27,854 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 23:45:27,855 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-21 23:45:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 23:45:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 23:45:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 23:45:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 23:45:27,867 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 23:45:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:27,867 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 23:45:27,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 23:45:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 23:45:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 23:45:27,869 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:27,870 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-21 23:45:27,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 23:45:27,870 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-21 23:45:27,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:27,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [747488771] [2020-08-21 23:45:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:27,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,044 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-21 23:45:28,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [747488771] [2020-08-21 23:45:28,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:28,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 23:45:28,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95999304] [2020-08-21 23:45:28,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 23:45:28,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:28,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 23:45:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:45:28,049 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-21 23:45:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:28,189 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-21 23:45:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 23:45:28,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-21 23:45:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:28,194 INFO L225 Difference]: With dead ends: 76 [2020-08-21 23:45:28,194 INFO L226 Difference]: Without dead ends: 45 [2020-08-21 23:45:28,195 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-21 23:45:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-21 23:45:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-21 23:45:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-21 23:45:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-21 23:45:28,213 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-21 23:45:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:28,213 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-21 23:45:28,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 23:45:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-21 23:45:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 23:45:28,216 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:28,216 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-21 23:45:28,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 23:45:28,216 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-21 23:45:28,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:28,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013587158] [2020-08-21 23:45:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,321 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-21 23:45:28,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013587158] [2020-08-21 23:45:28,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:28,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 23:45:28,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020142212] [2020-08-21 23:45:28,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 23:45:28,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 23:45:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:45:28,324 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-21 23:45:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:28,447 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-21 23:45:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 23:45:28,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 23:45:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:28,449 INFO L225 Difference]: With dead ends: 62 [2020-08-21 23:45:28,449 INFO L226 Difference]: Without dead ends: 58 [2020-08-21 23:45:28,450 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-21 23:45:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-21 23:45:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-21 23:45:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-21 23:45:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-21 23:45:28,466 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-21 23:45:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:28,467 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-21 23:45:28,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 23:45:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-21 23:45:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 23:45:28,471 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:28,472 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-21 23:45:28,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 23:45:28,472 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-21 23:45:28,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:28,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2146898100] [2020-08-21 23:45:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:28,769 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-21 23:45:28,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2146898100] [2020-08-21 23:45:28,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:28,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 23:45:28,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786734041] [2020-08-21 23:45:28,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 23:45:28,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:28,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 23:45:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 23:45:28,772 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-21 23:45:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:28,924 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-21 23:45:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:45:28,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-21 23:45:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:28,929 INFO L225 Difference]: With dead ends: 97 [2020-08-21 23:45:28,930 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 23:45:28,931 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-21 23:45:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 23:45:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-21 23:45:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-21 23:45:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-21 23:45:28,950 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-21 23:45:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:28,950 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-21 23:45:28,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 23:45:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-21 23:45:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-21 23:45:28,954 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:28,954 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-21 23:45:28,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 23:45:28,955 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-21 23:45:28,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:28,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719310590] [2020-08-21 23:45:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,438 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-21 23:45:29,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719310590] [2020-08-21 23:45:29,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:29,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-21 23:45:29,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044750495] [2020-08-21 23:45:29,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 23:45:29,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:29,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 23:45:29,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-21 23:45:29,441 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-21 23:45:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:29,873 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-21 23:45:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-21 23:45:29,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-21 23:45:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:29,878 INFO L225 Difference]: With dead ends: 153 [2020-08-21 23:45:29,878 INFO L226 Difference]: Without dead ends: 71 [2020-08-21 23:45:29,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-21 23:45:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-21 23:45:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-21 23:45:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-21 23:45:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-21 23:45:29,905 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-21 23:45:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:29,905 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-21 23:45:29,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 23:45:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-21 23:45:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-21 23:45:29,909 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:29,909 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-21 23:45:29,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 23:45:29,910 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-21 23:45:29,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:29,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [184447692] [2020-08-21 23:45:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:29,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,151 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-21 23:45:30,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [184447692] [2020-08-21 23:45:30,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:30,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 23:45:30,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561063932] [2020-08-21 23:45:30,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 23:45:30,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 23:45:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-21 23:45:30,154 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-21 23:45:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:30,316 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-21 23:45:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 23:45:30,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-21 23:45:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:30,319 INFO L225 Difference]: With dead ends: 68 [2020-08-21 23:45:30,319 INFO L226 Difference]: Without dead ends: 64 [2020-08-21 23:45:30,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-21 23:45:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-21 23:45:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-21 23:45:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-21 23:45:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-21 23:45:30,328 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-21 23:45:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:30,329 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-21 23:45:30,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 23:45:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-21 23:45:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 23:45:30,331 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:30,331 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-21 23:45:30,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 23:45:30,331 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-21 23:45:30,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:30,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948164073] [2020-08-21 23:45:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 23:45:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:30,729 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-21 23:45:30,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948164073] [2020-08-21 23:45:30,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:30,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 23:45:30,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888214883] [2020-08-21 23:45:30,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 23:45:30,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:30,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 23:45:30,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 23:45:30,732 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-21 23:45:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:30,939 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-21 23:45:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 23:45:30,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 23:45:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:30,944 INFO L225 Difference]: With dead ends: 180 [2020-08-21 23:45:30,944 INFO L226 Difference]: Without dead ends: 176 [2020-08-21 23:45:30,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-21 23:45:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-21 23:45:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-21 23:45:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-21 23:45:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-21 23:45:30,966 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-21 23:45:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:30,967 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-21 23:45:30,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 23:45:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-21 23:45:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-21 23:45:30,972 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:30,972 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-21 23:45:30,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 23:45:30,973 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-21 23:45:30,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:30,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516212881] [2020-08-21 23:45:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 23:45:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 23:45:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:31,827 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-21 23:45:31,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516212881] [2020-08-21 23:45:31,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:31,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 23:45:31,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600292208] [2020-08-21 23:45:31,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 23:45:31,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 23:45:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-21 23:45:31,831 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-21 23:45:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:32,135 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-21 23:45:32,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 23:45:32,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-21 23:45:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:32,142 INFO L225 Difference]: With dead ends: 410 [2020-08-21 23:45:32,142 INFO L226 Difference]: Without dead ends: 406 [2020-08-21 23:45:32,144 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-21 23:45:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-21 23:45:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-21 23:45:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-21 23:45:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-21 23:45:32,185 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-21 23:45:32,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:32,186 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-21 23:45:32,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 23:45:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-21 23:45:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-21 23:45:32,197 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:32,197 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-21 23:45:32,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 23:45:32,198 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-21 23:45:32,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:32,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [682619420] [2020-08-21 23:45:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:45:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 23:45:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:32,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 23:45:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 23:45:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 23:45:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 23:45:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 23:45:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 23:45:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:45:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 23:45:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 23:45:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:33,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 23:45:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:45:34,160 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-21 23:45:34,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [682619420] [2020-08-21 23:45:34,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:45:34,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-21 23:45:34,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766964138] [2020-08-21 23:45:34,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-21 23:45:34,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:45:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-21 23:45:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-21 23:45:34,163 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-21 23:45:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:45:35,139 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-21 23:45:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-21 23:45:35,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-21 23:45:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:45:35,143 INFO L225 Difference]: With dead ends: 531 [2020-08-21 23:45:35,143 INFO L226 Difference]: Without dead ends: 148 [2020-08-21 23:45:35,146 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-21 23:45:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-21 23:45:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-21 23:45:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-21 23:45:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-21 23:45:35,155 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-21 23:45:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:45:35,156 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-21 23:45:35,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-21 23:45:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-21 23:45:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-21 23:45:35,165 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:45:35,165 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-21 23:45:35,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 23:45:35,166 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:45:35,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:45:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-21 23:45:35,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:45:35,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [480774055] [2020-08-21 23:45:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:45:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 23:45:35,289 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 23:45:35,289 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 23:45:35,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 23:45:35,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:45:35 BoogieIcfgContainer [2020-08-21 23:45:35,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 23:45:35,342 INFO L168 Benchmark]: Toolchain (without parser) took 9407.25 ms. Allocated memory was 140.0 MB in the beginning and 535.8 MB in the end (delta: 395.8 MB). Free memory was 103.3 MB in the beginning and 498.6 MB in the end (delta: -395.3 MB). Peak memory consumption was 351.2 MB. Max. memory is 7.1 GB. [2020-08-21 23:45:35,343 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 23:45:35,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.81 ms. Allocated memory is still 140.0 MB. Free memory was 103.1 MB in the beginning and 93.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-08-21 23:45:35,346 INFO L168 Benchmark]: Boogie Preprocessor took 106.15 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 181.6 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-21 23:45:35,347 INFO L168 Benchmark]: RCFGBuilder took 247.91 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 169.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-08-21 23:45:35,350 INFO L168 Benchmark]: TraceAbstraction took 8801.91 ms. Allocated memory was 202.9 MB in the beginning and 535.8 MB in the end (delta: 332.9 MB). Free memory was 169.3 MB in the beginning and 498.6 MB in the end (delta: -329.3 MB). Peak memory consumption was 354.2 MB. Max. memory is 7.1 GB. [2020-08-21 23:45:35,361 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 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.81 ms. Allocated memory is still 140.0 MB. Free memory was 103.1 MB in the beginning and 93.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.15 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 181.6 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 247.91 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 169.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8801.91 ms. Allocated memory was 202.9 MB in the beginning and 535.8 MB in the end (delta: 332.9 MB). Free memory was 169.3 MB in the beginning and 498.6 MB in the end (delta: -329.3 MB). Peak memory consumption was 354.2 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: 8.6s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1360 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.7s 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.3s SatisfiabilityAnalysisTime, 4.3s 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...