/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=LOWLEXORDER --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-21 18:06:39,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 18:06:39,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 18:06:39,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 18:06:39,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 18:06:39,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 18:06:39,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 18:06:39,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 18:06:39,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 18:06:39,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 18:06:39,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 18:06:39,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 18:06:39,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 18:06:39,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 18:06:39,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 18:06:39,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 18:06:39,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 18:06:39,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 18:06:39,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 18:06:39,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 18:06:39,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 18:06:39,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 18:06:39,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 18:06:39,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 18:06:39,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 18:06:39,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 18:06:39,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 18:06:39,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 18:06:39,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 18:06:39,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 18:06:39,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 18:06:39,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 18:06:39,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 18:06:39,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 18:06:39,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 18:06:39,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 18:06:39,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 18:06:39,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 18:06:39,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 18:06:39,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 18:06:39,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 18:06:39,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 18:06:39,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 18:06:39,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 18:06:39,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 18:06:39,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 18:06:39,122 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 18:06:39,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 18:06:39,123 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 18:06:39,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 18:06:39,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 18:06:39,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 18:06:39,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 18:06:39,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 18:06:39,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 18:06:39,124 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 18:06:39,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 18:06:39,124 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 18:06:39,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 18:06:39,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 18:06:39,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 18:06:39,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 18:06:39,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 18:06:39,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 18:06:39,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 18:06:39,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 18:06:39,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 18:06:39,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 18:06:39,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 18:06:39,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 18:06:39,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 18:06:39,127 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=LOWLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=LOWLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=LOWLEXORDER;log-additional-information=true; [2020-08-21 18:06:39,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 18:06:39,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 18:06:39,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 18:06:39,444 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 18:06:39,444 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 18:06:39,445 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-21 18:06:39,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ccf9d5b1c/e4101b12cbed4231947ecd11aca7db7b/FLAG7a4ed6c8f [2020-08-21 18:06:39,972 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 18:06:39,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-21 18:06:39,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ccf9d5b1c/e4101b12cbed4231947ecd11aca7db7b/FLAG7a4ed6c8f [2020-08-21 18:06:40,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ccf9d5b1c/e4101b12cbed4231947ecd11aca7db7b [2020-08-21 18:06:40,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 18:06:40,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 18:06:40,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 18:06:40,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 18:06:40,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 18:06:40,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa43bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40, skipping insertion in model container [2020-08-21 18:06:40,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 18:06:40,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 18:06:40,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 18:06:40,590 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 18:06:40,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 18:06:40,614 INFO L208 MainTranslator]: Completed translation [2020-08-21 18:06:40,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40 WrapperNode [2020-08-21 18:06:40,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 18:06:40,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 18:06:40,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 18:06:40,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 18:06:40,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... [2020-08-21 18:06:40,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 18:06:40,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 18:06:40,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 18:06:40,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 18:06:40,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 18:06:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 18:06:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 18:06:40,779 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-21 18:06:40,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 18:06:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 18:06:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 18:06:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-21 18:06:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 18:06:40,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 18:06:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 18:06:40,951 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 18:06:40,951 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 18:06:40,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 06:06:40 BoogieIcfgContainer [2020-08-21 18:06:40,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 18:06:40,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 18:06:40,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 18:06:40,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 18:06:40,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 06:06:40" (1/3) ... [2020-08-21 18:06:40,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365457af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 06:06:40, skipping insertion in model container [2020-08-21 18:06:40,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:06:40" (2/3) ... [2020-08-21 18:06:40,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365457af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 06:06:40, skipping insertion in model container [2020-08-21 18:06:40,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 06:06:40" (3/3) ... [2020-08-21 18:06:40,965 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-21 18:06:40,976 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 18:06:40,983 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 18:06:40,998 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 18:06:41,024 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 18:06:41,024 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 18:06:41,024 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 18:06:41,024 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 18:06:41,025 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 18:06:41,025 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 18:06:41,025 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 18:06:41,025 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 18:06:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-21 18:06:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 18:06:41,051 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:41,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:06:41,053 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-21 18:06:41,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:41,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568278766] [2020-08-21 18:06:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 18:06:41,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568278766] [2020-08-21 18:06:41,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 18:06:41,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 18:06:41,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302219756] [2020-08-21 18:06:41,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 18:06:41,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:41,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 18:06:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 18:06:41,326 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-21 18:06:41,489 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-08-21 18:06:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:41,553 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 18:06:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 18:06:41,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 18:06:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:41,565 INFO L225 Difference]: With dead ends: 35 [2020-08-21 18:06:41,566 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 18:06:41,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 18:06:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 18:06:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 18:06:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 18:06:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 18:06:41,610 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 18:06:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:41,611 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 18:06:41,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 18:06:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 18:06:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 18:06:41,613 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:41,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:06:41,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 18:06:41,614 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-21 18:06:41,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:41,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925146697] [2020-08-21 18:06:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 18:06:41,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1925146697] [2020-08-21 18:06:41,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 18:06:41,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 18:06:41,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752019307] [2020-08-21 18:06:41,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 18:06:41,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 18:06:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 18:06:41,692 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 18:06:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:41,759 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 18:06:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 18:06:41,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 18:06:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:41,761 INFO L225 Difference]: With dead ends: 27 [2020-08-21 18:06:41,762 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 18:06:41,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 18:06:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 18:06:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 18:06:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 18:06:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 18:06:41,771 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 18:06:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:41,772 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 18:06:41,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 18:06:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 18:06:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 18:06:41,773 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:41,774 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:06:41,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 18:06:41,774 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:41,775 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-21 18:06:41,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:41,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1175863964] [2020-08-21 18:06:41,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 18:06:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-21 18:06:41,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1175863964] [2020-08-21 18:06:41,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:41,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 18:06:41,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179653818] [2020-08-21 18:06:41,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 18:06:41,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 18:06:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 18:06:41,969 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-21 18:06:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:42,112 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 18:06:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 18:06:42,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-21 18:06:42,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:42,114 INFO L225 Difference]: With dead ends: 38 [2020-08-21 18:06:42,114 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 18:06:42,117 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-21 18:06:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 18:06:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 18:06:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 18:06:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 18:06:42,132 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 18:06:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:42,133 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 18:06:42,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 18:06:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 18:06:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 18:06:42,137 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:42,138 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:06:42,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 18:06:42,139 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:42,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:42,139 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-21 18:06:42,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:42,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902565173] [2020-08-21 18:06:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-21 18:06:42,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902565173] [2020-08-21 18:06:42,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:42,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 18:06:42,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805041316] [2020-08-21 18:06:42,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 18:06:42,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 18:06:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 18:06:42,277 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 18:06:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:42,410 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 18:06:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 18:06:42,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 18:06:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:42,413 INFO L225 Difference]: With dead ends: 41 [2020-08-21 18:06:42,413 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 18:06:42,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-21 18:06:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 18:06:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 18:06:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 18:06:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 18:06:42,425 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 18:06:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:42,426 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 18:06:42,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 18:06:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 18:06:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 18:06:42,428 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:42,428 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:06:42,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 18:06:42,429 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-21 18:06:42,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:42,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225796266] [2020-08-21 18:06:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-21 18:06:42,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225796266] [2020-08-21 18:06:42,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:42,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 18:06:42,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090153850] [2020-08-21 18:06:42,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 18:06:42,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:42,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 18:06:42,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-21 18:06:42,587 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-21 18:06:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:42,714 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-21 18:06:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 18:06:42,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-21 18:06:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:42,717 INFO L225 Difference]: With dead ends: 79 [2020-08-21 18:06:42,717 INFO L226 Difference]: Without dead ends: 48 [2020-08-21 18:06:42,719 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-21 18:06:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-21 18:06:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-21 18:06:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-21 18:06:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-21 18:06:42,732 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-21 18:06:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:42,732 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-21 18:06:42,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 18:06:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-21 18:06:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 18:06:42,735 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:42,735 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:06:42,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 18:06:42,735 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-21 18:06:42,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:42,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954887318] [2020-08-21 18:06:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-21 18:06:42,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954887318] [2020-08-21 18:06:42,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:42,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 18:06:42,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131844121] [2020-08-21 18:06:42,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 18:06:42,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 18:06:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 18:06:42,867 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-21 18:06:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:42,975 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-21 18:06:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 18:06:42,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 18:06:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:42,980 INFO L225 Difference]: With dead ends: 65 [2020-08-21 18:06:42,981 INFO L226 Difference]: Without dead ends: 61 [2020-08-21 18:06:42,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 18:06:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-21 18:06:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-21 18:06:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-21 18:06:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-21 18:06:42,997 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-21 18:06:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:42,997 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-21 18:06:42,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 18:06:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-21 18:06:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-21 18:06:43,001 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:43,001 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-21 18:06:43,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 18:06:43,002 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-21 18:06:43,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:43,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1579424268] [2020-08-21 18:06:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,303 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-21 18:06:43,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1579424268] [2020-08-21 18:06:43,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:43,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 18:06:43,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292231208] [2020-08-21 18:06:43,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 18:06:43,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:43,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 18:06:43,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-21 18:06:43,306 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-21 18:06:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:43,620 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-21 18:06:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-21 18:06:43,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-21 18:06:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:43,624 INFO L225 Difference]: With dead ends: 107 [2020-08-21 18:06:43,624 INFO L226 Difference]: Without dead ends: 57 [2020-08-21 18:06:43,626 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-21 18:06:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-21 18:06:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-21 18:06:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-21 18:06:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-21 18:06:43,637 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-21 18:06:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:43,637 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-21 18:06:43,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 18:06:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-21 18:06:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-21 18:06:43,642 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:43,642 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-21 18:06:43,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 18:06:43,643 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-21 18:06:43,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:43,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827228244] [2020-08-21 18:06:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:43,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,133 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-21 18:06:44,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827228244] [2020-08-21 18:06:44,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:44,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 18:06:44,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988580033] [2020-08-21 18:06:44,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 18:06:44,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 18:06:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-21 18:06:44,137 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-21 18:06:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:44,586 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-21 18:06:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-21 18:06:44,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-21 18:06:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:44,593 INFO L225 Difference]: With dead ends: 115 [2020-08-21 18:06:44,594 INFO L226 Difference]: Without dead ends: 74 [2020-08-21 18:06:44,596 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-21 18:06:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-21 18:06:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-21 18:06:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-21 18:06:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-21 18:06:44,619 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-21 18:06:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:44,619 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-21 18:06:44,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 18:06:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-21 18:06:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 18:06:44,627 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:44,627 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:06:44,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 18:06:44,627 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:44,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-21 18:06:44,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:44,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109675745] [2020-08-21 18:06:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:44,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-21 18:06:45,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109675745] [2020-08-21 18:06:45,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:45,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 18:06:45,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681028695] [2020-08-21 18:06:45,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 18:06:45,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 18:06:45,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 18:06:45,185 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-21 18:06:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:45,410 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-21 18:06:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 18:06:45,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 18:06:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:45,415 INFO L225 Difference]: With dead ends: 186 [2020-08-21 18:06:45,415 INFO L226 Difference]: Without dead ends: 182 [2020-08-21 18:06:45,416 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-21 18:06:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-21 18:06:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-21 18:06:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-21 18:06:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-21 18:06:45,440 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-21 18:06:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:45,441 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-21 18:06:45,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 18:06:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-21 18:06:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-21 18:06:45,447 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:45,447 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-21 18:06:45,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 18:06:45,447 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-21 18:06:45,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:45,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68671699] [2020-08-21 18:06:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:45,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:06:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:46,538 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-21 18:06:46,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68671699] [2020-08-21 18:06:46,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:46,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-21 18:06:46,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294304614] [2020-08-21 18:06:46,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-21 18:06:46,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-21 18:06:46,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-21 18:06:46,541 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-21 18:06:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:47,368 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-21 18:06:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-21 18:06:47,368 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-21 18:06:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:47,371 INFO L225 Difference]: With dead ends: 281 [2020-08-21 18:06:47,371 INFO L226 Difference]: Without dead ends: 125 [2020-08-21 18:06:47,375 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-21 18:06:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-21 18:06:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-21 18:06:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-21 18:06:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-21 18:06:47,406 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-21 18:06:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:47,408 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-21 18:06:47,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-21 18:06:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-21 18:06:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-21 18:06:47,423 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:47,424 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-21 18:06:47,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 18:06:47,424 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-21 18:06:47,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:47,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242337739] [2020-08-21 18:06:47,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:47,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:47,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:47,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:06:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 18:06:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:48,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:06:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-21 18:06:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:49,577 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-21 18:06:49,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242337739] [2020-08-21 18:06:49,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:49,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-21 18:06:49,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460988375] [2020-08-21 18:06:49,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-21 18:06:49,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-21 18:06:49,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-21 18:06:49,581 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-21 18:06:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:50,512 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-21 18:06:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-21 18:06:50,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-21 18:06:50,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:50,521 INFO L225 Difference]: With dead ends: 226 [2020-08-21 18:06:50,521 INFO L226 Difference]: Without dead ends: 136 [2020-08-21 18:06:50,524 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-21 18:06:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-21 18:06:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-21 18:06:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-21 18:06:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-21 18:06:50,543 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-21 18:06:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:50,545 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-21 18:06:50,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-21 18:06:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-21 18:06:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-21 18:06:50,571 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:50,571 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-21 18:06:50,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 18:06:50,572 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:50,572 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-21 18:06:50,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:50,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1018412034] [2020-08-21 18:06:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:51,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:06:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:51,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:06:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:51,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:06:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 18:06:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-21 18:06:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:06:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:52,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:06:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:06:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:06:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:06:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:06:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:53,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:06:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:06:54,025 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-21 18:06:54,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1018412034] [2020-08-21 18:06:54,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:06:54,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 18:06:54,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2668169] [2020-08-21 18:06:54,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 18:06:54,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:06:54,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 18:06:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-21 18:06:54,030 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-21 18:06:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:06:54,347 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-21 18:06:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-21 18:06:54,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-21 18:06:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:06:54,361 INFO L225 Difference]: With dead ends: 486 [2020-08-21 18:06:54,361 INFO L226 Difference]: Without dead ends: 482 [2020-08-21 18:06:54,362 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-21 18:06:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-21 18:06:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-21 18:06:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-21 18:06:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-21 18:06:54,420 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-21 18:06:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:06:54,421 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-21 18:06:54,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 18:06:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-21 18:06:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-21 18:06:54,434 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:06:54,434 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-21 18:06:54,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 18:06:54,435 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:06:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:06:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-21 18:06:54,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:06:54,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545917288] [2020-08-21 18:06:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:06:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 18:06:55,086 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 18:06:55,086 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 18:06:55,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 18:06:55,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 06:06:55 BoogieIcfgContainer [2020-08-21 18:06:55,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 18:06:55,242 INFO L168 Benchmark]: Toolchain (without parser) took 14838.15 ms. Allocated memory was 139.5 MB in the beginning and 908.1 MB in the end (delta: 768.6 MB). Free memory was 102.0 MB in the beginning and 843.1 MB in the end (delta: -741.1 MB). Peak memory consumption was 679.9 MB. Max. memory is 7.1 GB. [2020-08-21 18:06:55,243 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 18:06:55,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.47 ms. Allocated memory is still 139.5 MB. Free memory was 101.8 MB in the beginning and 92.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-21 18:06:55,246 INFO L168 Benchmark]: Boogie Preprocessor took 96.47 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 92.5 MB in the beginning and 180.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-08-21 18:06:55,246 INFO L168 Benchmark]: RCFGBuilder took 244.08 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 168.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-08-21 18:06:55,247 INFO L168 Benchmark]: TraceAbstraction took 14277.06 ms. Allocated memory was 201.9 MB in the beginning and 908.1 MB in the end (delta: 706.2 MB). Free memory was 167.9 MB in the beginning and 843.1 MB in the end (delta: -675.2 MB). Peak memory consumption was 683.4 MB. Max. memory is 7.1 GB. [2020-08-21 18:06:55,256 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 215.47 ms. Allocated memory is still 139.5 MB. Free memory was 101.8 MB in the beginning and 92.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.47 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 92.5 MB in the beginning and 180.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 244.08 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 168.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14277.06 ms. Allocated memory was 201.9 MB in the beginning and 908.1 MB in the end (delta: 706.2 MB). Free memory was 167.9 MB in the beginning and 843.1 MB in the end (delta: -675.2 MB). Peak memory consumption was 683.4 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: 14.0s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1810 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s 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.8s SatisfiabilityAnalysisTime, 7.8s 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...