/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 CAMEL_NO_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 21:16:53,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 21:16:53,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 21:16:54,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 21:16:54,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 21:16:54,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 21:16:54,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 21:16:54,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 21:16:54,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 21:16:54,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 21:16:54,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 21:16:54,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 21:16:54,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 21:16:54,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 21:16:54,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 21:16:54,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 21:16:54,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 21:16:54,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 21:16:54,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 21:16:54,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 21:16:54,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 21:16:54,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 21:16:54,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 21:16:54,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 21:16:54,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 21:16:54,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 21:16:54,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 21:16:54,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 21:16:54,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 21:16:54,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 21:16:54,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 21:16:54,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 21:16:54,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 21:16:54,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 21:16:54,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 21:16:54,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 21:16:54,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 21:16:54,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 21:16:54,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 21:16:54,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 21:16:54,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 21:16:54,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-19 21:16:54,091 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 21:16:54,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 21:16:54,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 21:16:54,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 21:16:54,094 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 21:16:54,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 21:16:54,094 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 21:16:54,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 21:16:54,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 21:16:54,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 21:16:54,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 21:16:54,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 21:16:54,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 21:16:54,096 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 21:16:54,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 21:16:54,096 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 21:16:54,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 21:16:54,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 21:16:54,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 21:16:54,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 21:16:54,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 21:16:54,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:16:54,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 21:16:54,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 21:16:54,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 21:16:54,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 21:16:54,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 21:16:54,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 21:16:54,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 21:16:54,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_NO_AM [2020-07-19 21:16:54,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 21:16:54,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 21:16:54,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 21:16:54,482 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 21:16:54,483 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 21:16:54,484 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2020-07-19 21:16:54,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0518a0d/1d1482321ae641d89ea2f21d8a26e2c9/FLAG5f0fbbea6 [2020-07-19 21:16:55,122 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 21:16:55,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2020-07-19 21:16:55,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0518a0d/1d1482321ae641d89ea2f21d8a26e2c9/FLAG5f0fbbea6 [2020-07-19 21:16:55,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0518a0d/1d1482321ae641d89ea2f21d8a26e2c9 [2020-07-19 21:16:55,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 21:16:55,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 21:16:55,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 21:16:55,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 21:16:55,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 21:16:55,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2c4696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55, skipping insertion in model container [2020-07-19 21:16:55,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 21:16:55,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 21:16:55,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:16:55,705 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 21:16:55,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:16:55,740 INFO L208 MainTranslator]: Completed translation [2020-07-19 21:16:55,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55 WrapperNode [2020-07-19 21:16:55,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 21:16:55,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 21:16:55,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 21:16:55,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 21:16:55,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... [2020-07-19 21:16:55,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 21:16:55,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 21:16:55,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 21:16:55,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 21:16:55,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-07-19 21:16:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 21:16:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 21:16:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-19 21:16:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-19 21:16:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 21:16:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 21:16:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 21:16:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-19 21:16:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-19 21:16:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 21:16:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 21:16:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 21:16:56,197 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 21:16:56,198 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-19 21:16:56,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:16:56 BoogieIcfgContainer [2020-07-19 21:16:56,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 21:16:56,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 21:16:56,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 21:16:56,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 21:16:56,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:16:55" (1/3) ... [2020-07-19 21:16:56,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578f8c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:16:56, skipping insertion in model container [2020-07-19 21:16:56,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:16:55" (2/3) ... [2020-07-19 21:16:56,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578f8c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:16:56, skipping insertion in model container [2020-07-19 21:16:56,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:16:56" (3/3) ... [2020-07-19 21:16:56,219 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2020-07-19 21:16:56,232 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 21:16:56,243 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 21:16:56,291 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 21:16:56,340 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 21:16:56,341 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 21:16:56,341 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 21:16:56,341 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 21:16:56,341 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 21:16:56,342 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 21:16:56,342 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 21:16:56,342 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 21:16:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-19 21:16:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-19 21:16:56,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:16:56,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:16:56,410 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:16:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:16:56,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-19 21:16:56,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:16:56,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057579023] [2020-07-19 21:16:56,426 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:16:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:16:56,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057579023] [2020-07-19 21:16:56,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:16:56,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:16:56,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853863405] [2020-07-19 21:16:56,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:16:56,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:16:56,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:16:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:16:56,675 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-19 21:16:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:16:56,800 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-19 21:16:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:16:56,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-19 21:16:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:16:56,816 INFO L225 Difference]: With dead ends: 44 [2020-07-19 21:16:56,816 INFO L226 Difference]: Without dead ends: 30 [2020-07-19 21:16:56,821 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-07-19 21:16:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-19 21:16:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-19 21:16:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-19 21:16:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-19 21:16:56,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-19 21:16:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:16:56,883 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-19 21:16:56,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:16:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-19 21:16:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-19 21:16:56,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:16:56,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:16:56,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 21:16:56,888 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:16:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:16:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-19 21:16:56,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:16:56,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193055356] [2020-07-19 21:16:56,890 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:16:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:16:56,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193055356] [2020-07-19 21:16:56,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:16:56,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:16:56,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124030940] [2020-07-19 21:16:56,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:16:56,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:16:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:16:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:16:56,998 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-19 21:16:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:16:57,081 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-19 21:16:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:16:57,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-19 21:16:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:16:57,084 INFO L225 Difference]: With dead ends: 36 [2020-07-19 21:16:57,084 INFO L226 Difference]: Without dead ends: 32 [2020-07-19 21:16:57,086 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-07-19 21:16:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-19 21:16:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-19 21:16:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-19 21:16:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-19 21:16:57,098 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-19 21:16:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:16:57,099 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-19 21:16:57,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:16:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-19 21:16:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-19 21:16:57,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:16:57,101 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:16:57,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 21:16:57,102 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:16:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:16:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-19 21:16:57,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:16:57,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111387997] [2020-07-19 21:16:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:16:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:16:57,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111387997] [2020-07-19 21:16:57,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428701751] [2020-07-19 21:16:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:16:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:57,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 21:16:57,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:16:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:16:57,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:16:57,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-19 21:16:57,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845334755] [2020-07-19 21:16:57,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:16:57,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:16:57,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:16:57,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:16:57,464 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-19 21:16:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:16:57,758 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-19 21:16:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 21:16:57,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-19 21:16:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:16:57,761 INFO L225 Difference]: With dead ends: 58 [2020-07-19 21:16:57,761 INFO L226 Difference]: Without dead ends: 34 [2020-07-19 21:16:57,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-19 21:16:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-19 21:16:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-19 21:16:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-19 21:16:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-19 21:16:57,774 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-19 21:16:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:16:57,774 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-19 21:16:57,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:16:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-19 21:16:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-19 21:16:57,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:16:57,777 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:16:57,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-19 21:16:57,994 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:16:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:16:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-19 21:16:57,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:16:57,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273495279] [2020-07-19 21:16:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:16:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:16:58,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273495279] [2020-07-19 21:16:58,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204186670] [2020-07-19 21:16:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:16:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 21:16:58,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:16:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:16:58,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:16:58,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-19 21:16:58,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534972347] [2020-07-19 21:16:58,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 21:16:58,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:16:58,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 21:16:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:16:58,251 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-19 21:16:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:16:58,442 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-19 21:16:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 21:16:58,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-19 21:16:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:16:58,448 INFO L225 Difference]: With dead ends: 54 [2020-07-19 21:16:58,448 INFO L226 Difference]: Without dead ends: 50 [2020-07-19 21:16:58,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:16:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-19 21:16:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-19 21:16:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-19 21:16:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-19 21:16:58,464 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-19 21:16:58,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:16:58,465 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-19 21:16:58,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 21:16:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-19 21:16:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-19 21:16:58,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:16:58,467 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:16:58,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:16:58,682 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:16:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:16:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-19 21:16:58,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:16:58,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44954153] [2020-07-19 21:16:58,685 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:16:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-19 21:16:58,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44954153] [2020-07-19 21:16:58,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852098265] [2020-07-19 21:16:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:16:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:58,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 21:16:58,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:16:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-19 21:16:58,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:16:58,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-19 21:16:58,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650344881] [2020-07-19 21:16:58,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 21:16:58,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:16:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 21:16:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:16:58,948 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-19 21:16:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:16:59,263 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-19 21:16:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-19 21:16:59,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-19 21:16:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:16:59,267 INFO L225 Difference]: With dead ends: 108 [2020-07-19 21:16:59,267 INFO L226 Difference]: Without dead ends: 66 [2020-07-19 21:16:59,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-19 21:16:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-19 21:16:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-19 21:16:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-19 21:16:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-19 21:16:59,296 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-19 21:16:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:16:59,297 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-19 21:16:59,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 21:16:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-19 21:16:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-19 21:16:59,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:16:59,300 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:16:59,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:16:59,515 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:16:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:16:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-19 21:16:59,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:16:59,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607838681] [2020-07-19 21:16:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:16:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-19 21:16:59,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607838681] [2020-07-19 21:16:59,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721895037] [2020-07-19 21:16:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:16:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:16:59,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 21:16:59,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:16:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-19 21:16:59,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:16:59,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-19 21:16:59,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639562104] [2020-07-19 21:16:59,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:16:59,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:16:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:16:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:16:59,856 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-19 21:17:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:00,365 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-19 21:17:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-19 21:17:00,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-19 21:17:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:00,370 INFO L225 Difference]: With dead ends: 180 [2020-07-19 21:17:00,371 INFO L226 Difference]: Without dead ends: 120 [2020-07-19 21:17:00,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:17:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-19 21:17:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-19 21:17:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-19 21:17:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-19 21:17:00,405 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-19 21:17:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:00,406 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-19 21:17:00,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:17:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-19 21:17:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-19 21:17:00,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:00,411 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:00,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:00,626 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-19 21:17:00,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:00,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258058191] [2020-07-19 21:17:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-19 21:17:00,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258058191] [2020-07-19 21:17:00,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123650179] [2020-07-19 21:17:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:00,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 21:17:00,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-19 21:17:00,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:00,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-19 21:17:00,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335166927] [2020-07-19 21:17:00,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 21:17:00,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 21:17:00,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-19 21:17:00,973 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-07-19 21:17:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:01,573 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-19 21:17:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-19 21:17:01,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-19 21:17:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:01,579 INFO L225 Difference]: With dead ends: 258 [2020-07-19 21:17:01,580 INFO L226 Difference]: Without dead ends: 158 [2020-07-19 21:17:01,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-07-19 21:17:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-19 21:17:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-19 21:17:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-19 21:17:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-19 21:17:01,645 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-19 21:17:01,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:01,646 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-19 21:17:01,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 21:17:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-19 21:17:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-19 21:17:01,652 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:01,653 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:01,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-19 21:17:01,861 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-07-19 21:17:01,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:01,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47492243] [2020-07-19 21:17:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-19 21:17:02,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47492243] [2020-07-19 21:17:02,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988806747] [2020-07-19 21:17:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:02,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-19 21:17:02,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-19 21:17:02,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:02,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-19 21:17:02,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439685880] [2020-07-19 21:17:02,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-19 21:17:02,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:02,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-19 21:17:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-19 21:17:02,436 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-07-19 21:17:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:03,128 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-19 21:17:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-19 21:17:03,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-19 21:17:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:03,133 INFO L225 Difference]: With dead ends: 243 [2020-07-19 21:17:03,133 INFO L226 Difference]: Without dead ends: 110 [2020-07-19 21:17:03,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-07-19 21:17:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-19 21:17:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-19 21:17:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-19 21:17:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-19 21:17:03,151 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-07-19 21:17:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:03,152 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-19 21:17:03,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-19 21:17:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-19 21:17:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-19 21:17:03,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:03,155 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:03,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:03,364 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-07-19 21:17:03,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:03,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536172626] [2020-07-19 21:17:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-07-19 21:17:03,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536172626] [2020-07-19 21:17:03,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431873877] [2020-07-19 21:17:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:03,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-19 21:17:03,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2020-07-19 21:17:04,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:04,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-07-19 21:17:04,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607832913] [2020-07-19 21:17:04,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-19 21:17:04,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:04,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-19 21:17:04,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-19 21:17:04,043 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 17 states. [2020-07-19 21:17:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:04,891 INFO L93 Difference]: Finished difference Result 217 states and 375 transitions. [2020-07-19 21:17:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-19 21:17:04,892 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2020-07-19 21:17:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:04,895 INFO L225 Difference]: With dead ends: 217 [2020-07-19 21:17:04,895 INFO L226 Difference]: Without dead ends: 137 [2020-07-19 21:17:04,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-07-19 21:17:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-19 21:17:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-19 21:17:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-19 21:17:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2020-07-19 21:17:04,939 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 123 [2020-07-19 21:17:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:04,940 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2020-07-19 21:17:04,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-19 21:17:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2020-07-19 21:17:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-07-19 21:17:04,952 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:04,952 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:05,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:05,168 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash 466415905, now seen corresponding path program 1 times [2020-07-19 21:17:05,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:05,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430898452] [2020-07-19 21:17:05,170 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 165 proven. 262 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2020-07-19 21:17:05,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430898452] [2020-07-19 21:17:05,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216294522] [2020-07-19 21:17:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:05,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-19 21:17:05,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 418 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2020-07-19 21:17:06,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:06,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2020-07-19 21:17:06,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392386122] [2020-07-19 21:17:06,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-19 21:17:06,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-19 21:17:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-19 21:17:06,169 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 18 states. [2020-07-19 21:17:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:07,097 INFO L93 Difference]: Finished difference Result 263 states and 450 transitions. [2020-07-19 21:17:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-19 21:17:07,098 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2020-07-19 21:17:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:07,102 INFO L225 Difference]: With dead ends: 263 [2020-07-19 21:17:07,102 INFO L226 Difference]: Without dead ends: 158 [2020-07-19 21:17:07,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2020-07-19 21:17:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-19 21:17:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2020-07-19 21:17:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-19 21:17:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2020-07-19 21:17:07,126 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 231 [2020-07-19 21:17:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:07,127 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2020-07-19 21:17:07,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-19 21:17:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2020-07-19 21:17:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2020-07-19 21:17:07,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:07,138 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 25, 25, 21, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 9, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:07,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-19 21:17:07,354 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -80201483, now seen corresponding path program 2 times [2020-07-19 21:17:07,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:07,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185076791] [2020-07-19 21:17:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 243 proven. 571 refuted. 0 times theorem prover too weak. 2946 trivial. 0 not checked. [2020-07-19 21:17:08,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185076791] [2020-07-19 21:17:08,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233196454] [2020-07-19 21:17:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:09,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 21:17:09,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 139 proven. 856 refuted. 0 times theorem prover too weak. 2765 trivial. 0 not checked. [2020-07-19 21:17:09,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:09,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2020-07-19 21:17:09,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176824393] [2020-07-19 21:17:09,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-19 21:17:09,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:09,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-19 21:17:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:17:09,342 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 19 states. [2020-07-19 21:17:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:10,434 INFO L93 Difference]: Finished difference Result 337 states and 597 transitions. [2020-07-19 21:17:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-19 21:17:10,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 367 [2020-07-19 21:17:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:10,442 INFO L225 Difference]: With dead ends: 337 [2020-07-19 21:17:10,442 INFO L226 Difference]: Without dead ends: 200 [2020-07-19 21:17:10,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2020-07-19 21:17:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-07-19 21:17:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2020-07-19 21:17:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-19 21:17:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2020-07-19 21:17:10,472 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 367 [2020-07-19 21:17:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:10,475 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2020-07-19 21:17:10,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-19 21:17:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2020-07-19 21:17:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2020-07-19 21:17:10,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:10,494 INFO L422 BasicCegarLoop]: trace histogram [42, 42, 39, 39, 34, 32, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 19, 19, 19, 19, 15, 11, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:10,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:10,708 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash -495618503, now seen corresponding path program 3 times [2020-07-19 21:17:10,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:10,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310486190] [2020-07-19 21:17:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8989 backedges. 425 proven. 1461 refuted. 0 times theorem prover too weak. 7103 trivial. 0 not checked. [2020-07-19 21:17:12,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310486190] [2020-07-19 21:17:12,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855479856] [2020-07-19 21:17:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:12,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-19 21:17:12,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8989 backedges. 254 proven. 1547 refuted. 0 times theorem prover too weak. 7188 trivial. 0 not checked. [2020-07-19 21:17:13,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:13,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2020-07-19 21:17:13,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958708793] [2020-07-19 21:17:13,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-19 21:17:13,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:13,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-19 21:17:13,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:17:13,470 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand 22 states. [2020-07-19 21:17:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:15,123 INFO L93 Difference]: Finished difference Result 424 states and 800 transitions. [2020-07-19 21:17:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-19 21:17:15,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 559 [2020-07-19 21:17:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:15,134 INFO L225 Difference]: With dead ends: 424 [2020-07-19 21:17:15,135 INFO L226 Difference]: Without dead ends: 253 [2020-07-19 21:17:15,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=445, Invalid=2635, Unknown=0, NotChecked=0, Total=3080 [2020-07-19 21:17:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-19 21:17:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 218. [2020-07-19 21:17:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-19 21:17:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 360 transitions. [2020-07-19 21:17:15,178 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 360 transitions. Word has length 559 [2020-07-19 21:17:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:15,179 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 360 transitions. [2020-07-19 21:17:15,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-19 21:17:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 360 transitions. [2020-07-19 21:17:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2020-07-19 21:17:15,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:15,217 INFO L422 BasicCegarLoop]: trace histogram [63, 63, 60, 60, 50, 49, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 20, 18, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:15,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:15,431 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1928846884, now seen corresponding path program 4 times [2020-07-19 21:17:15,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:15,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644634142] [2020-07-19 21:17:15,450 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20893 backedges. 3107 proven. 2983 refuted. 0 times theorem prover too weak. 14803 trivial. 0 not checked. [2020-07-19 21:17:20,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644634142] [2020-07-19 21:17:20,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034670832] [2020-07-19 21:17:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:20,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 21:17:20,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20893 backedges. 700 proven. 1847 refuted. 0 times theorem prover too weak. 18346 trivial. 0 not checked. [2020-07-19 21:17:20,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:20,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2020-07-19 21:17:20,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889188354] [2020-07-19 21:17:20,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-19 21:17:20,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:20,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-19 21:17:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:17:20,883 INFO L87 Difference]: Start difference. First operand 218 states and 360 transitions. Second operand 22 states. [2020-07-19 21:17:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:22,595 INFO L93 Difference]: Finished difference Result 527 states and 957 transitions. [2020-07-19 21:17:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-07-19 21:17:22,596 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 844 [2020-07-19 21:17:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:22,604 INFO L225 Difference]: With dead ends: 527 [2020-07-19 21:17:22,604 INFO L226 Difference]: Without dead ends: 323 [2020-07-19 21:17:22,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=412, Invalid=2558, Unknown=0, NotChecked=0, Total=2970 [2020-07-19 21:17:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-07-19 21:17:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 269. [2020-07-19 21:17:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-19 21:17:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 438 transitions. [2020-07-19 21:17:22,643 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 438 transitions. Word has length 844 [2020-07-19 21:17:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:22,644 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 438 transitions. [2020-07-19 21:17:22,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-19 21:17:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 438 transitions. [2020-07-19 21:17:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2020-07-19 21:17:22,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:22,698 INFO L422 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 64, 63, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 25, 24, 16, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:22,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-19 21:17:22,914 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1318090551, now seen corresponding path program 5 times [2020-07-19 21:17:22,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:22,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073736309] [2020-07-19 21:17:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 34233 backedges. 1141 proven. 4104 refuted. 0 times theorem prover too weak. 28988 trivial. 0 not checked. [2020-07-19 21:17:28,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073736309] [2020-07-19 21:17:28,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280307191] [2020-07-19 21:17:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:29,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 2391 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 21:17:29,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 34233 backedges. 1046 proven. 2261 refuted. 0 times theorem prover too weak. 30926 trivial. 0 not checked. [2020-07-19 21:17:30,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:30,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2020-07-19 21:17:30,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894832864] [2020-07-19 21:17:30,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-19 21:17:30,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:30,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-19 21:17:30,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2020-07-19 21:17:30,189 INFO L87 Difference]: Start difference. First operand 269 states and 438 transitions. Second operand 23 states. [2020-07-19 21:17:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:32,154 INFO L93 Difference]: Finished difference Result 588 states and 1018 transitions. [2020-07-19 21:17:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-07-19 21:17:32,155 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1076 [2020-07-19 21:17:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:32,163 INFO L225 Difference]: With dead ends: 588 [2020-07-19 21:17:32,164 INFO L226 Difference]: Without dead ends: 333 [2020-07-19 21:17:32,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1447 GetRequests, 1389 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=466, Invalid=3074, Unknown=0, NotChecked=0, Total=3540 [2020-07-19 21:17:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-07-19 21:17:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 235. [2020-07-19 21:17:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-07-19 21:17:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2020-07-19 21:17:32,201 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 1076 [2020-07-19 21:17:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:32,202 INFO L479 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2020-07-19 21:17:32,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-19 21:17:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2020-07-19 21:17:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1703 [2020-07-19 21:17:32,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:32,250 INFO L422 BasicCegarLoop]: trace histogram [125, 125, 124, 124, 101, 100, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 39, 38, 25, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:32,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-19 21:17:32,465 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash -556163773, now seen corresponding path program 6 times [2020-07-19 21:17:32,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:32,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218214828] [2020-07-19 21:17:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 86632 backedges. 1221 proven. 7743 refuted. 0 times theorem prover too weak. 77668 trivial. 0 not checked. [2020-07-19 21:17:43,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218214828] [2020-07-19 21:17:43,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665617754] [2020-07-19 21:17:43,386 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:43,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 3781 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-19 21:17:43,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 86632 backedges. 1275 proven. 5425 refuted. 0 times theorem prover too weak. 79932 trivial. 0 not checked. [2020-07-19 21:17:45,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:45,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2020-07-19 21:17:45,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288980640] [2020-07-19 21:17:45,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-19 21:17:45,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:45,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-19 21:17:45,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2020-07-19 21:17:45,252 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand 25 states. [2020-07-19 21:17:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:47,418 INFO L93 Difference]: Finished difference Result 596 states and 1035 transitions. [2020-07-19 21:17:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-19 21:17:47,419 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1702 [2020-07-19 21:17:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:47,427 INFO L225 Difference]: With dead ends: 596 [2020-07-19 21:17:47,427 INFO L226 Difference]: Without dead ends: 295 [2020-07-19 21:17:47,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2256 GetRequests, 2198 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=439, Invalid=3101, Unknown=0, NotChecked=0, Total=3540 [2020-07-19 21:17:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-07-19 21:17:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 229. [2020-07-19 21:17:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-19 21:17:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 327 transitions. [2020-07-19 21:17:47,472 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 327 transitions. Word has length 1702 [2020-07-19 21:17:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:47,474 INFO L479 AbstractCegarLoop]: Abstraction has 229 states and 327 transitions. [2020-07-19 21:17:47,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-19 21:17:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 327 transitions. [2020-07-19 21:17:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2020-07-19 21:17:47,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:47,496 INFO L422 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 55, 54, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 22, 20, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:47,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-19 21:17:47,713 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:47,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1329713436, now seen corresponding path program 7 times [2020-07-19 21:17:47,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:47,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350566934] [2020-07-19 21:17:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25228 backedges. 1608 proven. 3283 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked. [2020-07-19 21:17:51,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350566934] [2020-07-19 21:17:51,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163220363] [2020-07-19 21:17:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:51,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 21:17:51,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:17:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 25228 backedges. 1476 proven. 1343 refuted. 0 times theorem prover too weak. 22409 trivial. 0 not checked. [2020-07-19 21:17:52,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:17:52,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 24 [2020-07-19 21:17:52,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487812455] [2020-07-19 21:17:52,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-19 21:17:52,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:17:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-19 21:17:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2020-07-19 21:17:52,211 INFO L87 Difference]: Start difference. First operand 229 states and 327 transitions. Second operand 24 states. [2020-07-19 21:17:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:17:53,842 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2020-07-19 21:17:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-07-19 21:17:53,842 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 926 [2020-07-19 21:17:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:17:53,847 INFO L225 Difference]: With dead ends: 522 [2020-07-19 21:17:53,847 INFO L226 Difference]: Without dead ends: 302 [2020-07-19 21:17:53,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=550, Invalid=3740, Unknown=0, NotChecked=0, Total=4290 [2020-07-19 21:17:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-07-19 21:17:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 236. [2020-07-19 21:17:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-07-19 21:17:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 325 transitions. [2020-07-19 21:17:53,870 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 325 transitions. Word has length 926 [2020-07-19 21:17:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:17:53,871 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 325 transitions. [2020-07-19 21:17:53,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-19 21:17:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 325 transitions. [2020-07-19 21:17:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2020-07-19 21:17:53,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:17:53,884 INFO L422 BasicCegarLoop]: trace histogram [74, 74, 71, 71, 59, 58, 37, 37, 37, 37, 37, 37, 37, 35, 35, 35, 35, 35, 35, 35, 24, 21, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:17:54,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:54,098 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:17:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:17:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1867430403, now seen corresponding path program 8 times [2020-07-19 21:17:54,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:17:54,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79957632] [2020-07-19 21:17:54,101 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:17:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 2570 proven. 3946 refuted. 0 times theorem prover too weak. 22636 trivial. 0 not checked. [2020-07-19 21:17:59,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79957632] [2020-07-19 21:17:59,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516242161] [2020-07-19 21:17:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:17:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:17:59,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 2209 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-19 21:17:59,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:18:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 1587 proven. 1068 refuted. 0 times theorem prover too weak. 26497 trivial. 0 not checked. [2020-07-19 21:18:00,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:18:00,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12] total 30 [2020-07-19 21:18:00,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229532613] [2020-07-19 21:18:00,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-19 21:18:00,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:18:00,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-19 21:18:00,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2020-07-19 21:18:00,614 INFO L87 Difference]: Start difference. First operand 236 states and 325 transitions. Second operand 30 states. [2020-07-19 21:18:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:18:03,433 INFO L93 Difference]: Finished difference Result 535 states and 772 transitions. [2020-07-19 21:18:03,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2020-07-19 21:18:03,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 994 [2020-07-19 21:18:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:18:03,438 INFO L225 Difference]: With dead ends: 535 [2020-07-19 21:18:03,439 INFO L226 Difference]: Without dead ends: 313 [2020-07-19 21:18:03,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1372 GetRequests, 1283 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2385 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=964, Invalid=7226, Unknown=0, NotChecked=0, Total=8190 [2020-07-19 21:18:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-07-19 21:18:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 253. [2020-07-19 21:18:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-19 21:18:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 342 transitions. [2020-07-19 21:18:03,466 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 342 transitions. Word has length 994 [2020-07-19 21:18:03,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:18:03,467 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 342 transitions. [2020-07-19 21:18:03,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-19 21:18:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 342 transitions. [2020-07-19 21:18:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1853 [2020-07-19 21:18:03,501 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:18:03,502 INFO L422 BasicCegarLoop]: trace histogram [138, 138, 133, 133, 110, 109, 69, 69, 69, 69, 69, 69, 69, 66, 66, 66, 66, 66, 66, 66, 44, 40, 28, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:18:03,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-19 21:18:03,716 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:18:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:18:03,717 INFO L82 PathProgramCache]: Analyzing trace with hash 232963646, now seen corresponding path program 9 times [2020-07-19 21:18:03,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:18:03,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626458076] [2020-07-19 21:18:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:18:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 9163 proven. 12629 refuted. 0 times theorem prover too weak. 80977 trivial. 0 not checked. [2020-07-19 21:18:12,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626458076] [2020-07-19 21:18:12,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290158406] [2020-07-19 21:18:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:18:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:12,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 4114 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-19 21:18:12,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:18:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 2314 proven. 5010 refuted. 0 times theorem prover too weak. 95445 trivial. 0 not checked. [2020-07-19 21:18:14,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:18:14,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 27 [2020-07-19 21:18:14,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320435543] [2020-07-19 21:18:14,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-19 21:18:14,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:18:14,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-19 21:18:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2020-07-19 21:18:14,227 INFO L87 Difference]: Start difference. First operand 253 states and 342 transitions. Second operand 27 states. [2020-07-19 21:18:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:18:16,341 INFO L93 Difference]: Finished difference Result 623 states and 902 transitions. [2020-07-19 21:18:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2020-07-19 21:18:16,342 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1852 [2020-07-19 21:18:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:18:16,349 INFO L225 Difference]: With dead ends: 623 [2020-07-19 21:18:16,349 INFO L226 Difference]: Without dead ends: 345 [2020-07-19 21:18:16,353 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2480 GetRequests, 2410 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=605, Invalid=4507, Unknown=0, NotChecked=0, Total=5112 [2020-07-19 21:18:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-07-19 21:18:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 267. [2020-07-19 21:18:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-07-19 21:18:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 350 transitions. [2020-07-19 21:18:16,374 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 350 transitions. Word has length 1852 [2020-07-19 21:18:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:18:16,375 INFO L479 AbstractCegarLoop]: Abstraction has 267 states and 350 transitions. [2020-07-19 21:18:16,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-19 21:18:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 350 transitions. [2020-07-19 21:18:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2020-07-19 21:18:16,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:18:16,386 INFO L422 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:18:16,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-19 21:18:16,599 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:18:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:18:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1627069240, now seen corresponding path program 10 times [2020-07-19 21:18:16,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:18:16,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909212278] [2020-07-19 21:18:16,602 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:18:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2639 proven. 3391 refuted. 0 times theorem prover too weak. 25606 trivial. 0 not checked. [2020-07-19 21:18:20,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909212278] [2020-07-19 21:18:20,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862850015] [2020-07-19 21:18:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:18:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:20,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 2300 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 21:18:20,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:18:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2426 proven. 749 refuted. 0 times theorem prover too weak. 28461 trivial. 0 not checked. [2020-07-19 21:18:21,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:18:21,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 25 [2020-07-19 21:18:21,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995147848] [2020-07-19 21:18:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-19 21:18:21,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:18:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-19 21:18:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2020-07-19 21:18:21,109 INFO L87 Difference]: Start difference. First operand 267 states and 350 transitions. Second operand 25 states. [2020-07-19 21:18:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:18:22,631 INFO L93 Difference]: Finished difference Result 311 states and 404 transitions. [2020-07-19 21:18:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-07-19 21:18:22,631 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1035 [2020-07-19 21:18:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:18:22,637 INFO L225 Difference]: With dead ends: 311 [2020-07-19 21:18:22,637 INFO L226 Difference]: Without dead ends: 293 [2020-07-19 21:18:22,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1395 GetRequests, 1336 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=455, Invalid=3205, Unknown=0, NotChecked=0, Total=3660 [2020-07-19 21:18:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-07-19 21:18:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 260. [2020-07-19 21:18:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-07-19 21:18:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 333 transitions. [2020-07-19 21:18:22,659 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 333 transitions. Word has length 1035 [2020-07-19 21:18:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:18:22,660 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 333 transitions. [2020-07-19 21:18:22,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-19 21:18:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 333 transitions. [2020-07-19 21:18:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2020-07-19 21:18:22,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:18:22,678 INFO L422 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 26, 26, 17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:18:22,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:18:22,892 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:18:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:18:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash 980558134, now seen corresponding path program 11 times [2020-07-19 21:18:22,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:18:22,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285728066] [2020-07-19 21:18:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:18:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4630 proven. 3919 refuted. 0 times theorem prover too weak. 30220 trivial. 0 not checked. [2020-07-19 21:18:27,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285728066] [2020-07-19 21:18:27,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123117052] [2020-07-19 21:18:27,091 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:18:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:27,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-19 21:18:27,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:18:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 2691 proven. 394 refuted. 0 times theorem prover too weak. 35684 trivial. 0 not checked. [2020-07-19 21:18:28,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:18:28,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 32 [2020-07-19 21:18:28,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703437214] [2020-07-19 21:18:28,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-07-19 21:18:28,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:18:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-07-19 21:18:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2020-07-19 21:18:28,271 INFO L87 Difference]: Start difference. First operand 260 states and 333 transitions. Second operand 32 states. [2020-07-19 21:18:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:18:30,489 INFO L93 Difference]: Finished difference Result 518 states and 661 transitions. [2020-07-19 21:18:30,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2020-07-19 21:18:30,490 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1144 [2020-07-19 21:18:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:18:30,494 INFO L225 Difference]: With dead ends: 518 [2020-07-19 21:18:30,494 INFO L226 Difference]: Without dead ends: 280 [2020-07-19 21:18:30,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1559 GetRequests, 1477 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=803, Invalid=6169, Unknown=0, NotChecked=0, Total=6972 [2020-07-19 21:18:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-07-19 21:18:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 220. [2020-07-19 21:18:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-07-19 21:18:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2020-07-19 21:18:30,516 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 1144 [2020-07-19 21:18:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:18:30,517 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2020-07-19 21:18:30,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-07-19 21:18:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2020-07-19 21:18:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2020-07-19 21:18:30,539 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:18:30,540 INFO L422 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 89, 88, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 34, 34, 22, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:18:30,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:18:30,755 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:18:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:18:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1471629456, now seen corresponding path program 12 times [2020-07-19 21:18:30,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:18:30,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680211353] [2020-07-19 21:18:30,757 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:18:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 3323 proven. 6811 refuted. 0 times theorem prover too weak. 56798 trivial. 0 not checked. [2020-07-19 21:18:36,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680211353] [2020-07-19 21:18:36,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429724420] [2020-07-19 21:18:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:18:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:18:37,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 3328 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-19 21:18:37,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:18:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 3453 proven. 2409 refuted. 0 times theorem prover too weak. 61070 trivial. 0 not checked. [2020-07-19 21:18:38,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:18:38,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 28 [2020-07-19 21:18:38,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409598036] [2020-07-19 21:18:38,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-19 21:18:38,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:18:38,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-19 21:18:38,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2020-07-19 21:18:38,708 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand 28 states. [2020-07-19 21:18:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:18:40,405 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2020-07-19 21:18:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-07-19 21:18:40,405 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1498 [2020-07-19 21:18:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:18:40,409 INFO L225 Difference]: With dead ends: 305 [2020-07-19 21:18:40,409 INFO L226 Difference]: Without dead ends: 239 [2020-07-19 21:18:40,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2002 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=584, Invalid=4246, Unknown=0, NotChecked=0, Total=4830 [2020-07-19 21:18:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-07-19 21:18:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2020-07-19 21:18:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-07-19 21:18:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 270 transitions. [2020-07-19 21:18:40,436 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 270 transitions. Word has length 1498 [2020-07-19 21:18:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:18:40,437 INFO L479 AbstractCegarLoop]: Abstraction has 232 states and 270 transitions. [2020-07-19 21:18:40,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-19 21:18:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 270 transitions. [2020-07-19 21:18:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-19 21:18:40,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:18:40,453 INFO L422 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:18:40,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:18:40,667 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:18:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:18:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 13 times [2020-07-19 21:18:40,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:18:40,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170737764] [2020-07-19 21:18:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2655d649 [2020-07-19 21:18:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 21:18:41,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 21:18:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 21:18:41,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 21:18:41,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2020-07-19 21:18:41,405 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-19 21:18:41,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-19 21:18:41,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:18:41 BoogieIcfgContainer [2020-07-19 21:18:41,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 21:18:41,558 INFO L168 Benchmark]: Toolchain (without parser) took 106086.91 ms. Allocated memory was 136.8 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 101.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-19 21:18:41,558 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-19 21:18:41,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.10 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-19 21:18:41,559 INFO L168 Benchmark]: Boogie Preprocessor took 29.62 ms. Allocated memory is still 136.8 MB. Free memory was 91.8 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-19 21:18:41,560 INFO L168 Benchmark]: RCFGBuilder took 433.06 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 90.2 MB in the beginning and 168.9 MB in the end (delta: -78.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-19 21:18:41,561 INFO L168 Benchmark]: TraceAbstraction took 105345.27 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 168.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-19 21:18:41,565 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.29 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.10 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.62 ms. Allocated memory is still 136.8 MB. Free memory was 91.8 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 433.06 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 90.2 MB in the beginning and 168.9 MB in the end (delta: -78.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105345.27 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 168.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 105.0s, OverallIterations: 22, TraceHistogramMax: 138, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 927 SDtfs, 2021 SDslu, 8626 SDs, 0 SdLazy, 17010 SolverSat, 2377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17200 GetRequests, 16324 SyntacticMatches, 0 SemanticMatches, 876 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13044 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 700 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 61.0s InterpolantComputationTime, 26477 NumberOfCodeBlocks, 26477 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 25225 ConstructedInterpolants, 0 QuantifiedInterpolants, 35215695 SizeOfPredicates, 144 NumberOfNonLiveVariables, 28057 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 827111/901960 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...