/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=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.1 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-22 03:00:13,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 03:00:13,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 03:00:13,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 03:00:13,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 03:00:13,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 03:00:13,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 03:00:13,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 03:00:13,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 03:00:13,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 03:00:13,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 03:00:13,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 03:00:13,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 03:00:13,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 03:00:13,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 03:00:13,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 03:00:13,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 03:00:13,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 03:00:13,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 03:00:13,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 03:00:13,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 03:00:13,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 03:00:13,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 03:00:13,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 03:00:13,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 03:00:13,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 03:00:13,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 03:00:13,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 03:00:13,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 03:00:13,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 03:00:13,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 03:00:13,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 03:00:13,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 03:00:13,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 03:00:13,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 03:00:13,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 03:00:13,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 03:00:13,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 03:00:13,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 03:00:13,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 03:00:13,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 03:00:13,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 03:00:13,584 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 03:00:13,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 03:00:13,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 03:00:13,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 03:00:13,586 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 03:00:13,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 03:00:13,586 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 03:00:13,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 03:00:13,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 03:00:13,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 03:00:13,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 03:00:13,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 03:00:13,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 03:00:13,588 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 03:00:13,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 03:00:13,588 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 03:00:13,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 03:00:13,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 03:00:13,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 03:00:13,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 03:00:13,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 03:00:13,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 03:00:13,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 03:00:13,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 03:00:13,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 03:00:13,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 03:00:13,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 03:00:13,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 03:00:13,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 03:00:13,591 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=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; [2020-08-22 03:00:13,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 03:00:13,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 03:00:13,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 03:00:13,926 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 03:00:13,927 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 03:00:13,928 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 03:00:13,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5dfc0e895/d9d60238cb0247d78f2da69fef3ba591/FLAGcf5d68aaa [2020-08-22 03:00:14,464 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 03:00:14,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 03:00:14,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5dfc0e895/d9d60238cb0247d78f2da69fef3ba591/FLAGcf5d68aaa [2020-08-22 03:00:14,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5dfc0e895/d9d60238cb0247d78f2da69fef3ba591 [2020-08-22 03:00:14,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 03:00:14,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 03:00:14,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 03:00:14,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 03:00:14,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 03:00:14,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 03:00:14" (1/1) ... [2020-08-22 03:00:14,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d96e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:14, skipping insertion in model container [2020-08-22 03:00:14,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 03:00:14" (1/1) ... [2020-08-22 03:00:14,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 03:00:14,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 03:00:15,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 03:00:15,070 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 03:00:15,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 03:00:15,102 INFO L208 MainTranslator]: Completed translation [2020-08-22 03:00:15,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15 WrapperNode [2020-08-22 03:00:15,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 03:00:15,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 03:00:15,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 03:00:15,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 03:00:15,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... [2020-08-22 03:00:15,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... [2020-08-22 03:00:15,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... [2020-08-22 03:00:15,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... [2020-08-22 03:00:15,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... [2020-08-22 03:00:15,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... [2020-08-22 03:00:15,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... [2020-08-22 03:00:15,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 03:00:15,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 03:00:15,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 03:00:15,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 03:00:15,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 03:00:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 03:00:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 03:00:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 03:00:15,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 03:00:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 03:00:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 03:00:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 03:00:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 03:00:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 03:00:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 03:00:15,516 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 03:00:15,516 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 03:00:15,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 03:00:15 BoogieIcfgContainer [2020-08-22 03:00:15,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 03:00:15,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 03:00:15,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 03:00:15,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 03:00:15,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 03:00:14" (1/3) ... [2020-08-22 03:00:15,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b55d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 03:00:15, skipping insertion in model container [2020-08-22 03:00:15,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:15" (2/3) ... [2020-08-22 03:00:15,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b55d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 03:00:15, skipping insertion in model container [2020-08-22 03:00:15,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 03:00:15" (3/3) ... [2020-08-22 03:00:15,530 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 03:00:15,542 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 03:00:15,550 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 03:00:15,566 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 03:00:15,610 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 03:00:15,610 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 03:00:15,611 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 03:00:15,611 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 03:00:15,611 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 03:00:15,611 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 03:00:15,612 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 03:00:15,612 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 03:00:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-22 03:00:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 03:00:15,646 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:15,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:15,648 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-22 03:00:15,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:15,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114389290] [2020-08-22 03:00:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:15,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:15,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 03:00:15,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114389290] [2020-08-22 03:00:15,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 03:00:15,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 03:00:15,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682818148] [2020-08-22 03:00:15,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 03:00:15,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 03:00:15,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 03:00:15,924 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-22 03:00:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:16,044 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 03:00:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 03:00:16,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 03:00:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:16,058 INFO L225 Difference]: With dead ends: 35 [2020-08-22 03:00:16,059 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 03:00:16,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:00:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 03:00:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 03:00:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 03:00:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 03:00:16,107 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 03:00:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:16,108 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 03:00:16,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 03:00:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 03:00:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 03:00:16,110 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:16,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:16,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 03:00:16,111 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:16,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-22 03:00:16,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:16,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719953467] [2020-08-22 03:00:16,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 03:00:16,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719953467] [2020-08-22 03:00:16,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 03:00:16,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 03:00:16,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218084888] [2020-08-22 03:00:16,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 03:00:16,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 03:00:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 03:00:16,184 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 03:00:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:16,251 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 03:00:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 03:00:16,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 03:00:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:16,253 INFO L225 Difference]: With dead ends: 27 [2020-08-22 03:00:16,253 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 03:00:16,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:00:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 03:00:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 03:00:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 03:00:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 03:00:16,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 03:00:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:16,263 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 03:00:16,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 03:00:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 03:00:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 03:00:16,267 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:16,267 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:16,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 03:00:16,267 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-22 03:00:16,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:16,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132731423] [2020-08-22 03:00:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 03:00:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 03:00:16,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132731423] [2020-08-22 03:00:16,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:16,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 03:00:16,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606605283] [2020-08-22 03:00:16,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 03:00:16,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 03:00:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:00:16,416 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-22 03:00:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:16,508 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 03:00:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 03:00:16,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-22 03:00:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:16,511 INFO L225 Difference]: With dead ends: 38 [2020-08-22 03:00:16,511 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 03:00:16,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-22 03:00:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 03:00:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 03:00:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 03:00:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 03:00:16,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 03:00:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:16,522 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 03:00:16,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 03:00:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 03:00:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 03:00:16,524 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:16,524 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:16,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 03:00:16,525 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:16,526 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-22 03:00:16,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:16,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316423424] [2020-08-22 03:00:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 03:00:16,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316423424] [2020-08-22 03:00:16,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:16,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 03:00:16,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358862270] [2020-08-22 03:00:16,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 03:00:16,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 03:00:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:00:16,711 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-22 03:00:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:16,853 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 03:00:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 03:00:16,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 03:00:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:16,856 INFO L225 Difference]: With dead ends: 41 [2020-08-22 03:00:16,856 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 03:00:16,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-22 03:00:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 03:00:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 03:00:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 03:00:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 03:00:16,870 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 03:00:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:16,870 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 03:00:16,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 03:00:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 03:00:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 03:00:16,873 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:16,873 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:16,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 03:00:16,874 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-22 03:00:16,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:16,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345137816] [2020-08-22 03:00:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:16,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 03:00:17,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345137816] [2020-08-22 03:00:17,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:17,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 03:00:17,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535292559] [2020-08-22 03:00:17,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 03:00:17,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 03:00:17,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 03:00:17,060 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-22 03:00:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:17,175 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-22 03:00:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 03:00:17,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-22 03:00:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:17,178 INFO L225 Difference]: With dead ends: 76 [2020-08-22 03:00:17,178 INFO L226 Difference]: Without dead ends: 45 [2020-08-22 03:00:17,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:00:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-22 03:00:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-22 03:00:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-22 03:00:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-22 03:00:17,192 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-22 03:00:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:17,195 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-22 03:00:17,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 03:00:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-22 03:00:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-22 03:00:17,197 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:17,200 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:17,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 03:00:17,201 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-22 03:00:17,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:17,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [234435183] [2020-08-22 03:00:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 03:00:17,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [234435183] [2020-08-22 03:00:17,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:17,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 03:00:17,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429822554] [2020-08-22 03:00:17,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 03:00:17,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 03:00:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 03:00:17,394 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-22 03:00:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:17,525 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-22 03:00:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 03:00:17,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-22 03:00:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:17,528 INFO L225 Difference]: With dead ends: 62 [2020-08-22 03:00:17,528 INFO L226 Difference]: Without dead ends: 58 [2020-08-22 03:00:17,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:00:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-22 03:00:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-22 03:00:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-22 03:00:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-22 03:00:17,544 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-22 03:00:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:17,545 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-22 03:00:17,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 03:00:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-22 03:00:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-22 03:00:17,550 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:17,550 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:17,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 03:00:17,551 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:17,551 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-22 03:00:17,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:17,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496400047] [2020-08-22 03:00:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-22 03:00:17,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496400047] [2020-08-22 03:00:17,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:17,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 03:00:17,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376976746] [2020-08-22 03:00:17,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 03:00:17,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:17,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 03:00:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 03:00:17,915 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-22 03:00:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:18,090 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-22 03:00:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 03:00:18,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-22 03:00:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:18,099 INFO L225 Difference]: With dead ends: 97 [2020-08-22 03:00:18,099 INFO L226 Difference]: Without dead ends: 93 [2020-08-22 03:00:18,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-22 03:00:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-22 03:00:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-22 03:00:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-22 03:00:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-22 03:00:18,143 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-22 03:00:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:18,143 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-22 03:00:18,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 03:00:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-22 03:00:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 03:00:18,151 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:18,151 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:18,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 03:00:18,151 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-22 03:00:18,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:18,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144375668] [2020-08-22 03:00:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-22 03:00:18,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144375668] [2020-08-22 03:00:18,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:18,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 03:00:18,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682015201] [2020-08-22 03:00:18,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 03:00:18,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:18,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 03:00:18,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 03:00:18,548 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-22 03:00:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:18,971 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-22 03:00:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 03:00:18,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-22 03:00:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:18,976 INFO L225 Difference]: With dead ends: 153 [2020-08-22 03:00:18,977 INFO L226 Difference]: Without dead ends: 71 [2020-08-22 03:00:18,983 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-22 03:00:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-22 03:00:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-22 03:00:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 03:00:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-22 03:00:19,002 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-22 03:00:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:19,004 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-22 03:00:19,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 03:00:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-22 03:00:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 03:00:19,010 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:19,010 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:19,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 03:00:19,010 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-22 03:00:19,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:19,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [662200786] [2020-08-22 03:00:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-22 03:00:19,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [662200786] [2020-08-22 03:00:19,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:19,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 03:00:19,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068070855] [2020-08-22 03:00:19,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 03:00:19,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 03:00:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 03:00:19,278 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-22 03:00:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:19,436 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-22 03:00:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 03:00:19,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-22 03:00:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:19,439 INFO L225 Difference]: With dead ends: 68 [2020-08-22 03:00:19,439 INFO L226 Difference]: Without dead ends: 64 [2020-08-22 03:00:19,439 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-22 03:00:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-22 03:00:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-22 03:00:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-22 03:00:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-22 03:00:19,448 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-22 03:00:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:19,449 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-22 03:00:19,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 03:00:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-22 03:00:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 03:00:19,451 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:19,451 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:19,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 03:00:19,452 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:19,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-22 03:00:19,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:19,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [201577305] [2020-08-22 03:00:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-22 03:00:19,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [201577305] [2020-08-22 03:00:19,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:19,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 03:00:19,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219364878] [2020-08-22 03:00:19,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 03:00:19,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:19,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 03:00:19,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:00:19,868 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-22 03:00:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:20,071 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-22 03:00:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 03:00:20,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-22 03:00:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:20,077 INFO L225 Difference]: With dead ends: 180 [2020-08-22 03:00:20,077 INFO L226 Difference]: Without dead ends: 176 [2020-08-22 03:00:20,078 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-22 03:00:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-22 03:00:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-22 03:00:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-22 03:00:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-22 03:00:20,125 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-22 03:00:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:20,126 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-22 03:00:20,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 03:00:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-22 03:00:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 03:00:20,136 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:20,136 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:20,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 03:00:20,137 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:20,137 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-22 03:00:20,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:20,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791201631] [2020-08-22 03:00:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-22 03:00:20,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791201631] [2020-08-22 03:00:20,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:20,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 03:00:20,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778674125] [2020-08-22 03:00:20,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 03:00:20,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 03:00:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 03:00:20,895 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-22 03:00:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:21,223 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-22 03:00:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 03:00:21,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-22 03:00:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:21,230 INFO L225 Difference]: With dead ends: 410 [2020-08-22 03:00:21,231 INFO L226 Difference]: Without dead ends: 406 [2020-08-22 03:00:21,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-22 03:00:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-22 03:00:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-22 03:00:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-22 03:00:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-22 03:00:21,270 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-22 03:00:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:21,271 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-22 03:00:21,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 03:00:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-22 03:00:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-22 03:00:21,292 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:21,292 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:21,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 03:00:21,293 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-22 03:00:21,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:21,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614189715] [2020-08-22 03:00:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:21,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:21,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:21,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:21,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:21,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:21,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 03:00:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:22,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-22 03:00:23,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614189715] [2020-08-22 03:00:23,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:23,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-22 03:00:23,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081459478] [2020-08-22 03:00:23,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 03:00:23,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 03:00:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-22 03:00:23,365 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-22 03:00:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:24,285 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-22 03:00:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 03:00:24,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-22 03:00:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:24,292 INFO L225 Difference]: With dead ends: 531 [2020-08-22 03:00:24,292 INFO L226 Difference]: Without dead ends: 148 [2020-08-22 03:00:24,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-22 03:00:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-22 03:00:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-22 03:00:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-22 03:00:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-22 03:00:24,311 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-22 03:00:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:24,312 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-22 03:00:24,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 03:00:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-22 03:00:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-22 03:00:24,322 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:24,322 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:24,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 03:00:24,322 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-22 03:00:24,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:24,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053112909] [2020-08-22 03:00:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 03:00:24,470 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 03:00:24,471 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 03:00:24,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 03:00:24,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 03:00:24 BoogieIcfgContainer [2020-08-22 03:00:24,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 03:00:24,568 INFO L168 Benchmark]: Toolchain (without parser) took 9688.18 ms. Allocated memory was 137.9 MB in the beginning and 553.6 MB in the end (delta: 415.8 MB). Free memory was 101.2 MB in the beginning and 455.1 MB in the end (delta: -354.0 MB). Peak memory consumption was 433.4 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:24,569 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-22 03:00:24,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.93 ms. Allocated memory is still 137.9 MB. Free memory was 101.0 MB in the beginning and 91.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:24,571 INFO L168 Benchmark]: Boogie Preprocessor took 129.63 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 91.6 MB in the beginning and 180.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:24,572 INFO L168 Benchmark]: RCFGBuilder took 287.56 ms. Allocated memory is still 201.3 MB. Free memory was 179.3 MB in the beginning and 167.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:24,579 INFO L168 Benchmark]: TraceAbstraction took 9039.47 ms. Allocated memory was 201.3 MB in the beginning and 553.6 MB in the end (delta: 352.3 MB). Free memory was 166.8 MB in the beginning and 455.1 MB in the end (delta: -288.3 MB). Peak memory consumption was 435.6 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:24,585 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 226.93 ms. Allocated memory is still 137.9 MB. Free memory was 101.0 MB in the beginning and 91.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.63 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 91.6 MB in the beginning and 180.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 287.56 ms. Allocated memory is still 201.3 MB. Free memory was 179.3 MB in the beginning and 167.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9039.47 ms. Allocated memory was 201.3 MB in the beginning and 553.6 MB in the end (delta: 352.3 MB). Free memory was 166.8 MB in the beginning and 455.1 MB in the end (delta: -288.3 MB). Peak memory consumption was 435.6 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.8s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1355 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.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.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...