/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.5 --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-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-22 06:14:43,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 06:14:43,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 06:14:43,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 06:14:43,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 06:14:43,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 06:14:43,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 06:14:43,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 06:14:43,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 06:14:43,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 06:14:43,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 06:14:43,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 06:14:43,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 06:14:43,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 06:14:43,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 06:14:43,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 06:14:43,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 06:14:43,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 06:14:43,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 06:14:43,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 06:14:43,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 06:14:43,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 06:14:44,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 06:14:44,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 06:14:44,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 06:14:44,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 06:14:44,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 06:14:44,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 06:14:44,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 06:14:44,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 06:14:44,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 06:14:44,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 06:14:44,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 06:14:44,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 06:14:44,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 06:14:44,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 06:14:44,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 06:14:44,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 06:14:44,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 06:14:44,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 06:14:44,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 06:14:44,013 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 06:14:44,036 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 06:14:44,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 06:14:44,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 06:14:44,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 06:14:44,038 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 06:14:44,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 06:14:44,038 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 06:14:44,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 06:14:44,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 06:14:44,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 06:14:44,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 06:14:44,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 06:14:44,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 06:14:44,040 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 06:14:44,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 06:14:44,040 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 06:14:44,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 06:14:44,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 06:14:44,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 06:14:44,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 06:14:44,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 06:14:44,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 06:14:44,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 06:14:44,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 06:14:44,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 06:14:44,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 06:14:44,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 06:14:44,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 06:14:44,043 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 06:14:44,043 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.5;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.5;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.5;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.5;log-additional-information=true; [2020-08-22 06:14:44,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 06:14:44,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 06:14:44,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 06:14:44,366 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 06:14:44,367 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 06:14:44,368 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-22 06:14:44,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1c440e30/4eb24ed0eea34aeeb5bed8fa5fd04311/FLAG5b5fca1d5 [2020-08-22 06:14:44,927 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 06:14:44,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-22 06:14:44,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1c440e30/4eb24ed0eea34aeeb5bed8fa5fd04311/FLAG5b5fca1d5 [2020-08-22 06:14:45,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1c440e30/4eb24ed0eea34aeeb5bed8fa5fd04311 [2020-08-22 06:14:45,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 06:14:45,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 06:14:45,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 06:14:45,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 06:14:45,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 06:14:45,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccf1036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45, skipping insertion in model container [2020-08-22 06:14:45,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 06:14:45,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 06:14:45,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 06:14:45,586 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 06:14:45,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 06:14:45,617 INFO L208 MainTranslator]: Completed translation [2020-08-22 06:14:45,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45 WrapperNode [2020-08-22 06:14:45,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 06:14:45,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 06:14:45,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 06:14:45,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 06:14:45,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (1/1) ... [2020-08-22 06:14:45,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 06:14:45,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 06:14:45,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 06:14:45,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 06:14:45,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (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 06:14:45,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 06:14:45,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 06:14:45,789 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-22 06:14:45,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 06:14:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 06:14:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 06:14:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-22 06:14:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 06:14:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 06:14:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 06:14:45,954 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 06:14:45,954 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 06:14:45,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:14:45 BoogieIcfgContainer [2020-08-22 06:14:45,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 06:14:45,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 06:14:45,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 06:14:45,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 06:14:45,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 06:14:45" (1/3) ... [2020-08-22 06:14:45,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4329c107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:14:45, skipping insertion in model container [2020-08-22 06:14:45,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:45" (2/3) ... [2020-08-22 06:14:45,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4329c107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:14:45, skipping insertion in model container [2020-08-22 06:14:45,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:14:45" (3/3) ... [2020-08-22 06:14:45,967 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-22 06:14:45,978 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 06:14:45,985 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 06:14:46,001 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 06:14:46,057 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 06:14:46,057 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 06:14:46,057 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 06:14:46,057 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 06:14:46,058 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 06:14:46,058 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 06:14:46,058 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 06:14:46,058 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 06:14:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-22 06:14:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 06:14:46,090 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:46,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:46,091 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-22 06:14:46,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:46,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1866374092] [2020-08-22 06:14:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,356 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 06:14:46,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1866374092] [2020-08-22 06:14:46,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 06:14:46,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 06:14:46,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254834553] [2020-08-22 06:14:46,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 06:14:46,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 06:14:46,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 06:14:46,379 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-22 06:14:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:46,487 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 06:14:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 06:14:46,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 06:14:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:46,500 INFO L225 Difference]: With dead ends: 35 [2020-08-22 06:14:46,501 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 06:14:46,505 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 06:14:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 06:14:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 06:14:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 06:14:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 06:14:46,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 06:14:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:46,549 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 06:14:46,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 06:14:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 06:14:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 06:14:46,551 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:46,552 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:46,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 06:14:46,552 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:46,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:46,553 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-22 06:14:46,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:46,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2083570406] [2020-08-22 06:14:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,622 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 06:14:46,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2083570406] [2020-08-22 06:14:46,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 06:14:46,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 06:14:46,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204923888] [2020-08-22 06:14:46,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 06:14:46,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:46,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 06:14:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 06:14:46,626 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 06:14:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:46,688 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 06:14:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 06:14:46,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 06:14:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:46,690 INFO L225 Difference]: With dead ends: 27 [2020-08-22 06:14:46,691 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 06:14:46,692 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 06:14:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 06:14:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 06:14:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 06:14:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 06:14:46,701 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 06:14:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:46,701 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 06:14:46,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 06:14:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 06:14:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 06:14:46,703 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:46,703 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 06:14:46,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 06:14:46,704 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:46,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-22 06:14:46,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:46,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899581125] [2020-08-22 06:14:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 06:14:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:46,834 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 06:14:46,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899581125] [2020-08-22 06:14:46,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:46,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 06:14:46,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712688203] [2020-08-22 06:14:46,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 06:14:46,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 06:14:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 06:14:46,837 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-22 06:14:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:46,948 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 06:14:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 06:14:46,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-22 06:14:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:46,950 INFO L225 Difference]: With dead ends: 38 [2020-08-22 06:14:46,950 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 06:14:46,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 06:14:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 06:14:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 06:14:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 06:14:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 06:14:46,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 06:14:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:46,961 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 06:14:46,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 06:14:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 06:14:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 06:14:46,963 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:46,964 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 06:14:46,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 06:14:46,964 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-22 06:14:46,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:46,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1738399558] [2020-08-22 06:14:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,143 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 06:14:47,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1738399558] [2020-08-22 06:14:47,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:47,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 06:14:47,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794690464] [2020-08-22 06:14:47,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 06:14:47,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:47,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 06:14:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 06:14:47,151 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-22 06:14:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:47,300 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 06:14:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 06:14:47,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 06:14:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:47,304 INFO L225 Difference]: With dead ends: 41 [2020-08-22 06:14:47,305 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 06:14:47,306 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 06:14:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 06:14:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 06:14:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 06:14:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 06:14:47,332 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 06:14:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:47,332 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 06:14:47,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 06:14:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 06:14:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 06:14:47,336 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:47,336 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 06:14:47,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 06:14:47,338 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:47,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-22 06:14:47,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:47,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [998542220] [2020-08-22 06:14:47,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,504 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 06:14:47,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [998542220] [2020-08-22 06:14:47,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:47,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 06:14:47,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016790594] [2020-08-22 06:14:47,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 06:14:47,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 06:14:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 06:14:47,507 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-22 06:14:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:47,642 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-22 06:14:47,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 06:14:47,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-22 06:14:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:47,645 INFO L225 Difference]: With dead ends: 79 [2020-08-22 06:14:47,645 INFO L226 Difference]: Without dead ends: 48 [2020-08-22 06:14:47,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-22 06:14:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-22 06:14:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-22 06:14:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 06:14:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-22 06:14:47,658 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-22 06:14:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:47,659 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-22 06:14:47,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 06:14:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-22 06:14:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-22 06:14:47,661 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:47,661 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 06:14:47,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 06:14:47,662 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-22 06:14:47,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:47,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [893039645] [2020-08-22 06:14:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,789 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 06:14:47,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [893039645] [2020-08-22 06:14:47,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:47,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 06:14:47,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019288949] [2020-08-22 06:14:47,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 06:14:47,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:47,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 06:14:47,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 06:14:47,792 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-22 06:14:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:47,898 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-22 06:14:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 06:14:47,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-22 06:14:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:47,900 INFO L225 Difference]: With dead ends: 65 [2020-08-22 06:14:47,901 INFO L226 Difference]: Without dead ends: 61 [2020-08-22 06:14:47,901 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 06:14:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-22 06:14:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-22 06:14:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-22 06:14:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-22 06:14:47,915 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-22 06:14:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:47,916 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-22 06:14:47,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 06:14:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-22 06:14:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-22 06:14:47,920 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:47,920 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:47,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 06:14:47,920 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-22 06:14:47,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:47,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [737798655] [2020-08-22 06:14:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:47,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-08-22 06:14:48,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [737798655] [2020-08-22 06:14:48,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:48,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 06:14:48,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735553511] [2020-08-22 06:14:48,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 06:14:48,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:48,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 06:14:48,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-22 06:14:48,229 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-22 06:14:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:48,585 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-22 06:14:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 06:14:48,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-22 06:14:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:48,589 INFO L225 Difference]: With dead ends: 107 [2020-08-22 06:14:48,589 INFO L226 Difference]: Without dead ends: 57 [2020-08-22 06:14:48,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-08-22 06:14:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-22 06:14:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-22 06:14:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-22 06:14:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-22 06:14:48,602 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-22 06:14:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:48,602 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-22 06:14:48,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 06:14:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-22 06:14:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-22 06:14:48,607 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:48,608 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:48,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 06:14:48,608 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-22 06:14:48,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:48,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171579714] [2020-08-22 06:14:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 193 proven. 313 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-08-22 06:14:48,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171579714] [2020-08-22 06:14:48,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:48,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 06:14:48,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279451918] [2020-08-22 06:14:48,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 06:14:48,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:48,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 06:14:48,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-22 06:14:48,979 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-22 06:14:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:49,450 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-22 06:14:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 06:14:49,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-22 06:14:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:49,453 INFO L225 Difference]: With dead ends: 115 [2020-08-22 06:14:49,453 INFO L226 Difference]: Without dead ends: 74 [2020-08-22 06:14:49,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-08-22 06:14:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-22 06:14:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-22 06:14:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 06:14:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-22 06:14:49,466 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-22 06:14:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:49,466 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-22 06:14:49,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 06:14:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-22 06:14:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 06:14:49,469 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:49,469 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 06:14:49,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 06:14:49,470 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-22 06:14:49,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:49,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854345321] [2020-08-22 06:14:49,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:49,985 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 06:14:49,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854345321] [2020-08-22 06:14:49,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:49,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 06:14:49,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835457129] [2020-08-22 06:14:49,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 06:14:49,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:49,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 06:14:49,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 06:14:49,998 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-22 06:14:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:50,268 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-22 06:14:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 06:14:50,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-22 06:14:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:50,277 INFO L225 Difference]: With dead ends: 186 [2020-08-22 06:14:50,277 INFO L226 Difference]: Without dead ends: 182 [2020-08-22 06:14:50,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-22 06:14:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-22 06:14:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-22 06:14:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-22 06:14:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-22 06:14:50,344 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-22 06:14:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:50,345 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-22 06:14:50,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 06:14:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-22 06:14:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-22 06:14:50,349 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:50,349 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:50,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 06:14:50,350 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:50,350 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-22 06:14:50,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:50,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638788289] [2020-08-22 06:14:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:50,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-08-22 06:14:51,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1638788289] [2020-08-22 06:14:51,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:51,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-22 06:14:51,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558069440] [2020-08-22 06:14:51,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-22 06:14:51,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:51,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-22 06:14:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-22 06:14:51,471 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-22 06:14:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:52,277 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-22 06:14:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-22 06:14:52,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-22 06:14:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:52,280 INFO L225 Difference]: With dead ends: 281 [2020-08-22 06:14:52,280 INFO L226 Difference]: Without dead ends: 125 [2020-08-22 06:14:52,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2020-08-22 06:14:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-22 06:14:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-22 06:14:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-22 06:14:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-22 06:14:52,297 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-22 06:14:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:52,297 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-22 06:14:52,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-22 06:14:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-22 06:14:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-22 06:14:52,310 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:52,311 INFO L422 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:52,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 06:14:52,311 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:52,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-22 06:14:52,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:52,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [625093889] [2020-08-22 06:14:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:52,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:52,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:52,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:52,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 06:14:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:53,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-22 06:14:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3272 proven. 3796 refuted. 0 times theorem prover too weak. 13923 trivial. 0 not checked. [2020-08-22 06:14:54,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [625093889] [2020-08-22 06:14:54,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:54,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-22 06:14:54,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301143473] [2020-08-22 06:14:54,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-22 06:14:54,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:54,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-22 06:14:54,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-22 06:14:54,879 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-22 06:14:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:55,866 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-22 06:14:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-22 06:14:55,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-22 06:14:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:55,871 INFO L225 Difference]: With dead ends: 226 [2020-08-22 06:14:55,871 INFO L226 Difference]: Without dead ends: 136 [2020-08-22 06:14:55,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-22 06:14:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-22 06:14:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-22 06:14:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-22 06:14:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-22 06:14:55,885 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-22 06:14:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:55,886 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-22 06:14:55,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-22 06:14:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-22 06:14:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-22 06:14:55,918 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:55,918 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:55,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 06:14:55,919 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-22 06:14:55,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:55,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039713647] [2020-08-22 06:14:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:56,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:56,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:56,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 06:14:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-22 06:14:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:57,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-08-22 06:14:58,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039713647] [2020-08-22 06:14:58,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:58,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 06:14:58,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240404349] [2020-08-22 06:14:58,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 06:14:58,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 06:14:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-22 06:14:58,720 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-22 06:14:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:59,115 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-22 06:14:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 06:14:59,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-22 06:14:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:59,127 INFO L225 Difference]: With dead ends: 486 [2020-08-22 06:14:59,127 INFO L226 Difference]: Without dead ends: 482 [2020-08-22 06:14:59,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-22 06:14:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-22 06:14:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-22 06:14:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-22 06:14:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-22 06:14:59,197 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-22 06:14:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:59,199 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-22 06:14:59,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 06:14:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-22 06:14:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-22 06:14:59,215 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:59,216 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:59,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 06:14:59,217 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-22 06:14:59,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:59,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1991424561] [2020-08-22 06:14:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 06:14:59,848 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 06:14:59,849 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 06:14:59,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 06:14:59,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 06:14:59 BoogieIcfgContainer [2020-08-22 06:14:59,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 06:14:59,933 INFO L168 Benchmark]: Toolchain (without parser) took 14614.98 ms. Allocated memory was 137.9 MB in the beginning and 789.6 MB in the end (delta: 651.7 MB). Free memory was 101.0 MB in the beginning and 143.3 MB in the end (delta: -42.3 MB). Peak memory consumption was 609.4 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:59,934 INFO L168 Benchmark]: CDTParser took 0.26 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.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-22 06:14:59,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.13 ms. Allocated memory is still 137.9 MB. Free memory was 100.5 MB in the beginning and 91.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:59,936 INFO L168 Benchmark]: Boogie Preprocessor took 110.74 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 91.4 MB in the beginning and 179.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:59,936 INFO L168 Benchmark]: RCFGBuilder took 228.78 ms. Allocated memory is still 200.8 MB. Free memory was 179.9 MB in the beginning and 167.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:59,937 INFO L168 Benchmark]: TraceAbstraction took 13971.17 ms. Allocated memory was 200.8 MB in the beginning and 789.6 MB in the end (delta: 588.8 MB). Free memory was 166.4 MB in the beginning and 143.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 611.9 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:59,944 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.26 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.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.13 ms. Allocated memory is still 137.9 MB. Free memory was 100.5 MB in the beginning and 91.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.74 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 91.4 MB in the beginning and 179.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 228.78 ms. Allocated memory is still 200.8 MB. Free memory was 179.9 MB in the beginning and 167.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13971.17 ms. Allocated memory was 200.8 MB in the beginning and 789.6 MB in the end (delta: 588.8 MB). Free memory was 166.4 MB in the beginning and 143.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 611.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.8s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1802 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, 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, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 3443 NumberOfCodeBlocks, 3443 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1448155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52623/63131 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...