/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:15,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:15,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:15,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:15,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:15,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:15,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:15,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:15,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:15,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:15,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:15,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:15,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:15,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:15,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:15,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:15,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:15,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:15,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:15,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:15,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:15,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:15,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:15,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:15,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:15,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:15,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:15,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:15,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:15,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:15,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:15,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:15,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:15,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:15,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:15,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:15,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:15,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:15,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:15,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:15,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:15,100 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 [2019-11-23 22:48:15,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:15,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:15,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:15,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:15,120 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:15,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:15,121 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:15,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:15,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:15,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:15,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:15,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:15,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:15,122 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:15,122 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:15,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:15,122 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:15,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:15,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:15,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:15,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:15,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:15,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:15,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:15,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:15,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:15,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:15,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:15,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:15,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:15,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:15,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:15,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:15,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:15,448 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:15,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-11-23 22:48:15,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfd46311/c67afeaa804541bca915711c9ef05d3e/FLAG79de37e61 [2019-11-23 22:48:16,036 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:16,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-11-23 22:48:16,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfd46311/c67afeaa804541bca915711c9ef05d3e/FLAG79de37e61 [2019-11-23 22:48:16,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfd46311/c67afeaa804541bca915711c9ef05d3e [2019-11-23 22:48:16,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:16,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:16,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:16,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:16,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:16,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:16,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee4f3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16, skipping insertion in model container [2019-11-23 22:48:16,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:16,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:16,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:16,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:16,755 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:16,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:16,939 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:16,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16 WrapperNode [2019-11-23 22:48:16,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:16,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:16,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:16,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:16,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:16,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:17,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:17,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:17,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:17,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (1/1) ... [2019-11-23 22:48:17,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:17,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:17,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:17,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:17,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (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 [2019-11-23 22:48:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:17,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:17,253 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:18,001 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:18,001 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:18,004 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:18,004 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:18,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:18 BoogieIcfgContainer [2019-11-23 22:48:18,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:18,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:18,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:18,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:18,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:16" (1/3) ... [2019-11-23 22:48:18,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a444810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:18, skipping insertion in model container [2019-11-23 22:48:18,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:16" (2/3) ... [2019-11-23 22:48:18,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a444810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:18, skipping insertion in model container [2019-11-23 22:48:18,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:18" (3/3) ... [2019-11-23 22:48:18,019 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-11-23 22:48:18,030 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:18,039 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:18,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:18,094 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:18,094 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:18,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:18,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:18,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:18,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:18,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:18,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-23 22:48:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 22:48:18,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,139 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-23 22:48:18,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751348851] [2019-11-23 22:48:18,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:18,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751348851] [2019-11-23 22:48:18,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686813643] [2019-11-23 22:48:18,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,427 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-23 22:48:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,785 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-23 22:48:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-23 22:48:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,814 INFO L225 Difference]: With dead ends: 327 [2019-11-23 22:48:18,814 INFO L226 Difference]: Without dead ends: 174 [2019-11-23 22:48:18,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-23 22:48:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-23 22:48:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-23 22:48:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-23 22:48:18,915 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-23 22:48:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,917 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-23 22:48:18,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-23 22:48:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:48:18,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,923 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,923 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-23 22:48:18,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520350348] [2019-11-23 22:48:18,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:19,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520350348] [2019-11-23 22:48:19,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794928524] [2019-11-23 22:48:19,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,024 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-23 22:48:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,263 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-23 22:48:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 22:48:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,266 INFO L225 Difference]: With dead ends: 379 [2019-11-23 22:48:19,266 INFO L226 Difference]: Without dead ends: 215 [2019-11-23 22:48:19,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-23 22:48:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-23 22:48:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-23 22:48:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-23 22:48:19,288 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-23 22:48:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,289 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-23 22:48:19,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-23 22:48:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 22:48:19,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,296 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,296 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2019-11-23 22:48:19,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404652789] [2019-11-23 22:48:19,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:19,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404652789] [2019-11-23 22:48:19,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791475013] [2019-11-23 22:48:19,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,435 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-23 22:48:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,643 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-23 22:48:19,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 22:48:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,646 INFO L225 Difference]: With dead ends: 444 [2019-11-23 22:48:19,646 INFO L226 Difference]: Without dead ends: 241 [2019-11-23 22:48:19,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-23 22:48:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-23 22:48:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-23 22:48:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-23 22:48:19,663 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-23 22:48:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,664 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-23 22:48:19,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-23 22:48:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:19,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,668 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,668 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2019-11-23 22:48:19,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035815932] [2019-11-23 22:48:19,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:19,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035815932] [2019-11-23 22:48:19,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453100263] [2019-11-23 22:48:19,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,762 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-23 22:48:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,886 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-23 22:48:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,888 INFO L225 Difference]: With dead ends: 492 [2019-11-23 22:48:19,888 INFO L226 Difference]: Without dead ends: 258 [2019-11-23 22:48:19,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-23 22:48:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-23 22:48:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-23 22:48:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-23 22:48:19,902 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-23 22:48:19,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,903 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-23 22:48:19,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-23 22:48:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:19,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,906 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:48:19,906 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2019-11-23 22:48:19,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61238199] [2019-11-23 22:48:19,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:19,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61238199] [2019-11-23 22:48:19,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679571677] [2019-11-23 22:48:19,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,980 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-23 22:48:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,158 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2019-11-23 22:48:20,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,161 INFO L225 Difference]: With dead ends: 552 [2019-11-23 22:48:20,161 INFO L226 Difference]: Without dead ends: 303 [2019-11-23 22:48:20,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-23 22:48:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2019-11-23 22:48:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:48:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-23 22:48:20,174 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-23 22:48:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,175 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-23 22:48:20,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-23 22:48:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:20,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,177 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:20,177 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2019-11-23 22:48:20,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481780329] [2019-11-23 22:48:20,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:20,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481780329] [2019-11-23 22:48:20,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:20,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844351161] [2019-11-23 22:48:20,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,243 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-23 22:48:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,364 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-23 22:48:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,367 INFO L225 Difference]: With dead ends: 591 [2019-11-23 22:48:20,367 INFO L226 Difference]: Without dead ends: 300 [2019-11-23 22:48:20,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-23 22:48:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-23 22:48:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:48:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-23 22:48:20,383 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-23 22:48:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,384 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-23 22:48:20,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-23 22:48:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:20,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,385 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:48:20,386 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,386 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2019-11-23 22:48:20,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915668080] [2019-11-23 22:48:20,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:20,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915668080] [2019-11-23 22:48:20,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:20,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044280882] [2019-11-23 22:48:20,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,499 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-23 22:48:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,685 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2019-11-23 22:48:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,687 INFO L225 Difference]: With dead ends: 594 [2019-11-23 22:48:20,688 INFO L226 Difference]: Without dead ends: 301 [2019-11-23 22:48:20,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-23 22:48:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2019-11-23 22:48:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-23 22:48:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-23 22:48:20,699 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-23 22:48:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,699 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-23 22:48:20,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-23 22:48:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 22:48:20,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,701 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:20,701 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2019-11-23 22:48:20,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607185669] [2019-11-23 22:48:20,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 22:48:20,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607185669] [2019-11-23 22:48:20,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:20,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197729870] [2019-11-23 22:48:20,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,765 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-23 22:48:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,911 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-23 22:48:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 22:48:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,915 INFO L225 Difference]: With dead ends: 594 [2019-11-23 22:48:20,916 INFO L226 Difference]: Without dead ends: 305 [2019-11-23 22:48:20,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-23 22:48:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-23 22:48:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-23 22:48:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-23 22:48:20,936 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-23 22:48:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,937 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-23 22:48:20,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-23 22:48:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:48:20,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,940 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-11-23 22:48:20,940 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2019-11-23 22:48:20,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854787147] [2019-11-23 22:48:20,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:21,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854787147] [2019-11-23 22:48:21,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:21,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:21,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468119939] [2019-11-23 22:48:21,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:21,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:21,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,057 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-23 22:48:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:21,388 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-23 22:48:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:21,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:48:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:21,392 INFO L225 Difference]: With dead ends: 634 [2019-11-23 22:48:21,392 INFO L226 Difference]: Without dead ends: 336 [2019-11-23 22:48:21,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-23 22:48:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-23 22:48:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-23 22:48:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-23 22:48:21,406 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-23 22:48:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:21,406 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-23 22:48:21,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-23 22:48:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:48:21,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:21,408 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:21,408 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2019-11-23 22:48:21,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:21,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032624701] [2019-11-23 22:48:21,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:21,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032624701] [2019-11-23 22:48:21,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:21,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:21,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072733921] [2019-11-23 22:48:21,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,460 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-23 22:48:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:21,636 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-23 22:48:21,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:21,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-23 22:48:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:21,638 INFO L225 Difference]: With dead ends: 663 [2019-11-23 22:48:21,642 INFO L226 Difference]: Without dead ends: 336 [2019-11-23 22:48:21,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-23 22:48:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-23 22:48:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-23 22:48:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-23 22:48:21,657 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-23 22:48:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:21,659 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-23 22:48:21,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-23 22:48:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:48:21,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:21,662 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:21,662 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2019-11-23 22:48:21,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:21,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616043095] [2019-11-23 22:48:21,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:21,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616043095] [2019-11-23 22:48:21,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:21,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:21,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164232390] [2019-11-23 22:48:21,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:21,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,711 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-23 22:48:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:21,867 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-23 22:48:21,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:21,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:48:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:21,871 INFO L225 Difference]: With dead ends: 696 [2019-11-23 22:48:21,871 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 22:48:21,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 22:48:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-23 22:48:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-23 22:48:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-23 22:48:21,888 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-23 22:48:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:21,889 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-23 22:48:21,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-23 22:48:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:48:21,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:21,891 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1] [2019-11-23 22:48:21,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2019-11-23 22:48:21,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:21,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871634226] [2019-11-23 22:48:21,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:21,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871634226] [2019-11-23 22:48:21,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:21,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:21,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046837727] [2019-11-23 22:48:21,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:21,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:21,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:21,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:21,938 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-23 22:48:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,119 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-23 22:48:22,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:48:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,122 INFO L225 Difference]: With dead ends: 723 [2019-11-23 22:48:22,122 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 22:48:22,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 22:48:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-23 22:48:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-23 22:48:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-23 22:48:22,136 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-23 22:48:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,136 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-23 22:48:22,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-23 22:48:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:48:22,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,138 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-23 22:48:22,138 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2019-11-23 22:48:22,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108044158] [2019-11-23 22:48:22,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:22,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108044158] [2019-11-23 22:48:22,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:22,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627504975] [2019-11-23 22:48:22,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,176 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-23 22:48:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,308 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-11-23 22:48:22,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:48:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,310 INFO L225 Difference]: With dead ends: 740 [2019-11-23 22:48:22,310 INFO L226 Difference]: Without dead ends: 386 [2019-11-23 22:48:22,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-23 22:48:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-23 22:48:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:48:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-23 22:48:22,326 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-23 22:48:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,326 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-23 22:48:22,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-23 22:48:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:48:22,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,328 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-23 22:48:22,328 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2019-11-23 22:48:22,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26768167] [2019-11-23 22:48:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:22,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26768167] [2019-11-23 22:48:22,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:22,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103241037] [2019-11-23 22:48:22,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,371 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-23 22:48:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,502 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-11-23 22:48:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:48:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,505 INFO L225 Difference]: With dead ends: 761 [2019-11-23 22:48:22,505 INFO L226 Difference]: Without dead ends: 386 [2019-11-23 22:48:22,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-23 22:48:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-23 22:48:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:48:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-23 22:48:22,520 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-23 22:48:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,521 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-23 22:48:22,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-23 22:48:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:48:22,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,523 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:22,523 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2019-11-23 22:48:22,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546788771] [2019-11-23 22:48:22,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 22:48:22,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546788771] [2019-11-23 22:48:22,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:22,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416754775] [2019-11-23 22:48:22,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,579 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-23 22:48:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,624 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-23 22:48:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 22:48:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,630 INFO L225 Difference]: With dead ends: 757 [2019-11-23 22:48:22,630 INFO L226 Difference]: Without dead ends: 755 [2019-11-23 22:48:22,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-23 22:48:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-23 22:48:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-23 22:48:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-23 22:48:22,659 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-23 22:48:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,660 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-23 22:48:22,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-23 22:48:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:48:22,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,662 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:22,663 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2019-11-23 22:48:22,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197977369] [2019-11-23 22:48:22,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 22:48:22,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197977369] [2019-11-23 22:48:22,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:22,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146226875] [2019-11-23 22:48:22,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,723 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-23 22:48:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,777 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2019-11-23 22:48:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:48:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,783 INFO L225 Difference]: With dead ends: 1831 [2019-11-23 22:48:22,783 INFO L226 Difference]: Without dead ends: 1083 [2019-11-23 22:48:22,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-23 22:48:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-11-23 22:48:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-11-23 22:48:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2019-11-23 22:48:22,821 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2019-11-23 22:48:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,822 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2019-11-23 22:48:22,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2019-11-23 22:48:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:48:22,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,825 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:22,825 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,825 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2019-11-23 22:48:22,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76091779] [2019-11-23 22:48:22,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:22,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76091779] [2019-11-23 22:48:22,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:22,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:22,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050481751] [2019-11-23 22:48:22,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:22,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,859 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2019-11-23 22:48:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:22,919 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2019-11-23 22:48:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:22,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:48:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:22,927 INFO L225 Difference]: With dead ends: 2528 [2019-11-23 22:48:22,927 INFO L226 Difference]: Without dead ends: 1452 [2019-11-23 22:48:22,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-23 22:48:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2019-11-23 22:48:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-11-23 22:48:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2019-11-23 22:48:22,979 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2019-11-23 22:48:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:22,979 INFO L462 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2019-11-23 22:48:22,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2019-11-23 22:48:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 22:48:22,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:22,983 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:22,983 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2019-11-23 22:48:22,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:22,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133001786] [2019-11-23 22:48:22,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 22:48:23,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133001786] [2019-11-23 22:48:23,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:23,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:23,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973025447] [2019-11-23 22:48:23,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:23,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:23,016 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2019-11-23 22:48:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:23,084 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2019-11-23 22:48:23,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:23,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 22:48:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:23,094 INFO L225 Difference]: With dead ends: 3248 [2019-11-23 22:48:23,094 INFO L226 Difference]: Without dead ends: 1803 [2019-11-23 22:48:23,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-11-23 22:48:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-11-23 22:48:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-23 22:48:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2019-11-23 22:48:23,174 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2019-11-23 22:48:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:23,174 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2019-11-23 22:48:23,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2019-11-23 22:48:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-23 22:48:23,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:23,182 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-11-23 22:48:23,183 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2019-11-23 22:48:23,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:23,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505004220] [2019-11-23 22:48:23,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 22:48:23,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505004220] [2019-11-23 22:48:23,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:23,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:23,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552717030] [2019-11-23 22:48:23,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:23,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:23,291 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2019-11-23 22:48:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:23,501 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2019-11-23 22:48:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:23,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-23 22:48:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:23,510 INFO L225 Difference]: With dead ends: 3649 [2019-11-23 22:48:23,510 INFO L226 Difference]: Without dead ends: 1853 [2019-11-23 22:48:23,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-11-23 22:48:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2019-11-23 22:48:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-23 22:48:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2019-11-23 22:48:23,577 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2019-11-23 22:48:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:23,577 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2019-11-23 22:48:23,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2019-11-23 22:48:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 22:48:23,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:23,583 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:23,584 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2019-11-23 22:48:23,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:23,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063654691] [2019-11-23 22:48:23,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-23 22:48:23,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063654691] [2019-11-23 22:48:23,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:23,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:23,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786177249] [2019-11-23 22:48:23,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:23,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:23,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:23,661 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2019-11-23 22:48:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:23,924 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2019-11-23 22:48:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:23,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-23 22:48:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:23,937 INFO L225 Difference]: With dead ends: 3666 [2019-11-23 22:48:23,937 INFO L226 Difference]: Without dead ends: 1870 [2019-11-23 22:48:23,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-11-23 22:48:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2019-11-23 22:48:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-23 22:48:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2019-11-23 22:48:24,023 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2019-11-23 22:48:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:24,024 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2019-11-23 22:48:24,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2019-11-23 22:48:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-23 22:48:24,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:24,033 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:24,033 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2019-11-23 22:48:24,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:24,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480955578] [2019-11-23 22:48:24,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-23 22:48:24,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480955578] [2019-11-23 22:48:24,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973429355] [2019-11-23 22:48:24,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-23 22:48:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:24,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:24,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-23 22:48:24,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:24,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:24,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061133608] [2019-11-23 22:48:24,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:24,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:24,425 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2019-11-23 22:48:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:24,927 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2019-11-23 22:48:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:24,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-23 22:48:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:24,940 INFO L225 Difference]: With dead ends: 4264 [2019-11-23 22:48:24,940 INFO L226 Difference]: Without dead ends: 2435 [2019-11-23 22:48:24,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-11-23 22:48:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2019-11-23 22:48:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-11-23 22:48:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2019-11-23 22:48:25,015 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2019-11-23 22:48:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:25,016 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2019-11-23 22:48:25,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2019-11-23 22:48:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-23 22:48:25,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:25,022 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:48:25,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:25,226 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2019-11-23 22:48:25,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:25,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588813570] [2019-11-23 22:48:25,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-23 22:48:25,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588813570] [2019-11-23 22:48:25,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:25,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:25,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467647942] [2019-11-23 22:48:25,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:25,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:25,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:25,368 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2019-11-23 22:48:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:25,583 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2019-11-23 22:48:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:25,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-23 22:48:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:25,593 INFO L225 Difference]: With dead ends: 3394 [2019-11-23 22:48:25,593 INFO L226 Difference]: Without dead ends: 1678 [2019-11-23 22:48:25,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-11-23 22:48:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2019-11-23 22:48:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-11-23 22:48:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2019-11-23 22:48:25,710 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2019-11-23 22:48:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:25,710 INFO L462 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2019-11-23 22:48:25,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2019-11-23 22:48:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 22:48:25,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:25,721 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-23 22:48:25,721 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:25,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2019-11-23 22:48:25,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:25,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180520047] [2019-11-23 22:48:25,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-23 22:48:25,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180520047] [2019-11-23 22:48:25,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699616907] [2019-11-23 22:48:25,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-23 22:48:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:26,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-23 22:48:26,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:26,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:26,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278556474] [2019-11-23 22:48:26,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:26,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:26,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:26,088 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2019-11-23 22:48:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:26,527 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2019-11-23 22:48:26,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:26,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-23 22:48:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:26,545 INFO L225 Difference]: With dead ends: 5319 [2019-11-23 22:48:26,546 INFO L226 Difference]: Without dead ends: 3648 [2019-11-23 22:48:26,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-11-23 22:48:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2019-11-23 22:48:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-11-23 22:48:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2019-11-23 22:48:26,695 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2019-11-23 22:48:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:26,696 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2019-11-23 22:48:26,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2019-11-23 22:48:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 22:48:26,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:26,703 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-23 22:48:26,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:26,909 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2019-11-23 22:48:26,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:26,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121523368] [2019-11-23 22:48:26,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-23 22:48:27,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121523368] [2019-11-23 22:48:27,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:27,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821939902] [2019-11-23 22:48:27,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,063 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2019-11-23 22:48:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,219 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2019-11-23 22:48:27,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-23 22:48:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,240 INFO L225 Difference]: With dead ends: 5741 [2019-11-23 22:48:27,240 INFO L226 Difference]: Without dead ends: 3745 [2019-11-23 22:48:27,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-23 22:48:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2019-11-23 22:48:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-23 22:48:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2019-11-23 22:48:27,453 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2019-11-23 22:48:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,453 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2019-11-23 22:48:27,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2019-11-23 22:48:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-23 22:48:27,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,468 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,468 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2019-11-23 22:48:27,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439265794] [2019-11-23 22:48:27,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-23 22:48:27,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439265794] [2019-11-23 22:48:27,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:27,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001176560] [2019-11-23 22:48:27,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,647 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2019-11-23 22:48:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,994 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2019-11-23 22:48:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-23 22:48:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,005 INFO L225 Difference]: With dead ends: 7697 [2019-11-23 22:48:28,005 INFO L226 Difference]: Without dead ends: 3961 [2019-11-23 22:48:28,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-11-23 22:48:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2019-11-23 22:48:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-23 22:48:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2019-11-23 22:48:28,223 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2019-11-23 22:48:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,224 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2019-11-23 22:48:28,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2019-11-23 22:48:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-23 22:48:28,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,241 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,241 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2019-11-23 22:48:28,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452506243] [2019-11-23 22:48:28,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-23 22:48:28,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452506243] [2019-11-23 22:48:28,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:28,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411634808] [2019-11-23 22:48:28,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,387 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2019-11-23 22:48:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,661 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2019-11-23 22:48:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-11-23 22:48:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,670 INFO L225 Difference]: With dead ends: 7611 [2019-11-23 22:48:28,671 INFO L226 Difference]: Without dead ends: 3875 [2019-11-23 22:48:28,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-11-23 22:48:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2019-11-23 22:48:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2019-11-23 22:48:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2019-11-23 22:48:28,833 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2019-11-23 22:48:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,834 INFO L462 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2019-11-23 22:48:28,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2019-11-23 22:48:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-23 22:48:28,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,846 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:28,846 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2019-11-23 22:48:28,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954367964] [2019-11-23 22:48:28,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-11-23 22:48:28,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954367964] [2019-11-23 22:48:28,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:28,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17806875] [2019-11-23 22:48:28,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,995 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2019-11-23 22:48:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,235 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2019-11-23 22:48:29,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-23 22:48:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,245 INFO L225 Difference]: With dead ends: 8043 [2019-11-23 22:48:29,245 INFO L226 Difference]: Without dead ends: 4215 [2019-11-23 22:48:29,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2019-11-23 22:48:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2019-11-23 22:48:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-11-23 22:48:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2019-11-23 22:48:29,406 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2019-11-23 22:48:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,406 INFO L462 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2019-11-23 22:48:29,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2019-11-23 22:48:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-23 22:48:29,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,419 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,419 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2019-11-23 22:48:29,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63200834] [2019-11-23 22:48:29,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-23 22:48:29,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63200834] [2019-11-23 22:48:29,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143209241] [2019-11-23 22:48:29,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,544 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2019-11-23 22:48:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,720 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2019-11-23 22:48:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-23 22:48:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,726 INFO L225 Difference]: With dead ends: 6854 [2019-11-23 22:48:29,726 INFO L226 Difference]: Without dead ends: 2132 [2019-11-23 22:48:29,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-23 22:48:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2019-11-23 22:48:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-23 22:48:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2019-11-23 22:48:29,799 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2019-11-23 22:48:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,799 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2019-11-23 22:48:29,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2019-11-23 22:48:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-23 22:48:29,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,807 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,807 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2019-11-23 22:48:29,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404852809] [2019-11-23 22:48:29,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-11-23 22:48:29,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404852809] [2019-11-23 22:48:29,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322910570] [2019-11-23 22:48:29,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,971 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2019-11-23 22:48:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,148 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2019-11-23 22:48:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-23 22:48:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,153 INFO L225 Difference]: With dead ends: 4297 [2019-11-23 22:48:30,154 INFO L226 Difference]: Without dead ends: 2172 [2019-11-23 22:48:30,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-11-23 22:48:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2019-11-23 22:48:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-23 22:48:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2019-11-23 22:48:30,220 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2019-11-23 22:48:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,221 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2019-11-23 22:48:30,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2019-11-23 22:48:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-23 22:48:30,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,229 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,229 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2019-11-23 22:48:30,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413772503] [2019-11-23 22:48:30,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-23 22:48:30,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413772503] [2019-11-23 22:48:30,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616668731] [2019-11-23 22:48:30,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,386 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2019-11-23 22:48:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,573 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2019-11-23 22:48:30,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-23 22:48:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,578 INFO L225 Difference]: With dead ends: 4267 [2019-11-23 22:48:30,578 INFO L226 Difference]: Without dead ends: 2142 [2019-11-23 22:48:30,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-23 22:48:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2019-11-23 22:48:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-23 22:48:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2019-11-23 22:48:30,656 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2019-11-23 22:48:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,657 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2019-11-23 22:48:30,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2019-11-23 22:48:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-23 22:48:30,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,666 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2019-11-23 22:48:30,666 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2019-11-23 22:48:30,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725684553] [2019-11-23 22:48:30,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-23 22:48:30,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725684553] [2019-11-23 22:48:30,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141341210] [2019-11-23 22:48:30,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-23 22:48:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:30,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-11-23 22:48:31,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:31,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:31,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644471796] [2019-11-23 22:48:31,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:31,183 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 3 states. [2019-11-23 22:48:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,246 INFO L93 Difference]: Finished difference Result 2710 states and 3447 transitions. [2019-11-23 22:48:31,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-23 22:48:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,252 INFO L225 Difference]: With dead ends: 2710 [2019-11-23 22:48:31,252 INFO L226 Difference]: Without dead ends: 2572 [2019-11-23 22:48:31,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-23 22:48:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1996. [2019-11-23 22:48:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-11-23 22:48:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2539 transitions. [2019-11-23 22:48:31,325 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2539 transitions. Word has length 392 [2019-11-23 22:48:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,326 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 2539 transitions. [2019-11-23 22:48:31,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2539 transitions. [2019-11-23 22:48:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-23 22:48:31,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,335 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:31,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:31,539 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1194864871, now seen corresponding path program 1 times [2019-11-23 22:48:31,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432198050] [2019-11-23 22:48:31,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-23 22:48:31,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432198050] [2019-11-23 22:48:31,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485979774] [2019-11-23 22:48:31,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-23 22:48:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:31,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-23 22:48:32,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:32,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:32,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770082248] [2019-11-23 22:48:32,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:32,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:32,076 INFO L87 Difference]: Start difference. First operand 1996 states and 2539 transitions. Second operand 4 states. [2019-11-23 22:48:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,453 INFO L93 Difference]: Finished difference Result 5015 states and 6403 transitions. [2019-11-23 22:48:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:32,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-23 22:48:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,460 INFO L225 Difference]: With dead ends: 5015 [2019-11-23 22:48:32,461 INFO L226 Difference]: Without dead ends: 2984 [2019-11-23 22:48:32,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2019-11-23 22:48:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2156. [2019-11-23 22:48:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-11-23 22:48:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2019-11-23 22:48:32,537 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 408 [2019-11-23 22:48:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,538 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2019-11-23 22:48:32,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2019-11-23 22:48:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-11-23 22:48:32,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,548 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:32,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:32,754 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,754 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2019-11-23 22:48:32,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320126796] [2019-11-23 22:48:32,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-11-23 22:48:32,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320126796] [2019-11-23 22:48:32,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:32,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929182200] [2019-11-23 22:48:32,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,949 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2019-11-23 22:48:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,130 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2019-11-23 22:48:33,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-11-23 22:48:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,136 INFO L225 Difference]: With dead ends: 4485 [2019-11-23 22:48:33,136 INFO L226 Difference]: Without dead ends: 2336 [2019-11-23 22:48:33,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-11-23 22:48:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2019-11-23 22:48:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-11-23 22:48:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2019-11-23 22:48:33,214 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2019-11-23 22:48:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,215 INFO L462 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2019-11-23 22:48:33,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2019-11-23 22:48:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-23 22:48:33,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,232 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:33,232 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2019-11-23 22:48:33,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964267442] [2019-11-23 22:48:33,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-11-23 22:48:33,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964267442] [2019-11-23 22:48:33,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:33,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:33,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264730945] [2019-11-23 22:48:33,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:33,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:33,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:33,466 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2019-11-23 22:48:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,646 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2019-11-23 22:48:33,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2019-11-23 22:48:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,651 INFO L225 Difference]: With dead ends: 4640 [2019-11-23 22:48:33,651 INFO L226 Difference]: Without dead ends: 2321 [2019-11-23 22:48:33,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-11-23 22:48:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2019-11-23 22:48:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-11-23 22:48:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2019-11-23 22:48:33,722 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2019-11-23 22:48:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,722 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2019-11-23 22:48:33,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2019-11-23 22:48:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-11-23 22:48:33,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,729 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:33,730 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2019-11-23 22:48:33,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56158162] [2019-11-23 22:48:33,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-23 22:48:34,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56158162] [2019-11-23 22:48:34,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225140148] [2019-11-23 22:48:34,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-23 22:48:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:34,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-23 22:48:34,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:34,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:34,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92082630] [2019-11-23 22:48:34,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:34,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:34,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:34,402 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2019-11-23 22:48:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,591 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2019-11-23 22:48:34,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:34,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2019-11-23 22:48:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,592 INFO L225 Difference]: With dead ends: 3916 [2019-11-23 22:48:34,592 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:48:34,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:48:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:48:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:48:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:48:34,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2019-11-23 22:48:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,597 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:48:34,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:48:34,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:48:34,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:34,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:48:36,062 WARN L192 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-23 22:48:37,137 WARN L192 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-23 22:48:37,584 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-11-23 22:48:37,977 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-23 22:48:38,351 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-23 22:48:38,589 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-11-23 22:48:38,765 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2019-11-23 22:48:39,049 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-11-23 22:48:41,448 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-11-23 22:48:41,783 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-11-23 22:48:42,186 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2019-11-23 22:48:42,423 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-23 22:48:42,643 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 25 [2019-11-23 22:48:42,957 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-11-23 22:48:43,266 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-23 22:48:43,679 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-23 22:48:44,074 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2019-11-23 22:48:44,509 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-23 22:48:47,120 WARN L192 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-11-23 22:48:47,389 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-23 22:48:47,655 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-23 22:48:47,930 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2019-11-23 22:48:48,205 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-23 22:48:48,209 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-23 22:48:48,210 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-23 22:48:48,210 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-23 22:48:48,210 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2))) [2019-11-23 22:48:48,211 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-11-23 22:48:48,211 INFO L447 ceAbstractionStarter]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-11-23 22:48:48,211 INFO L444 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-11-23 22:48:48,211 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-11-23 22:48:48,211 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-11-23 22:48:48,212 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-11-23 22:48:48,212 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-11-23 22:48:48,212 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-23 22:48:48,212 INFO L444 ceAbstractionStarter]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-23 22:48:48,213 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-23 22:48:48,213 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-23 22:48:48,213 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-23 22:48:48,213 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-23 22:48:48,214 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-23 22:48:48,214 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-11-23 22:48:48,214 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-11-23 22:48:48,214 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-11-23 22:48:48,214 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-11-23 22:48:48,214 INFO L444 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-11-23 22:48:48,214 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-11-23 22:48:48,214 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-11-23 22:48:48,215 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-11-23 22:48:48,216 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-23 22:48:48,216 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-23 22:48:48,216 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-23 22:48:48,216 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2019-11-23 22:48:48,216 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-23 22:48:48,217 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-23 22:48:48,217 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-23 22:48:48,217 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-23 22:48:48,217 INFO L447 ceAbstractionStarter]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-11-23 22:48:48,218 INFO L440 ceAbstractionStarter]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-11-23 22:48:48,218 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-23 22:48:48,219 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:48:48,219 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-11-23 22:48:48,219 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-11-23 22:48:48,219 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:48:48,219 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-11-23 22:48:48,219 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-11-23 22:48:48,219 INFO L440 ceAbstractionStarter]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-11-23 22:48:48,220 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0))) [2019-11-23 22:48:48,220 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-23 22:48:48,220 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-23 22:48:48,220 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:48:48,220 INFO L444 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-11-23 22:48:48,220 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-23 22:48:48,220 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-23 22:48:48,220 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-11-23 22:48:48,221 INFO L444 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-11-23 22:48:48,221 INFO L440 ceAbstractionStarter]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-23 22:48:48,221 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:48:48,221 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-11-23 22:48:48,221 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-11-23 22:48:48,221 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-11-23 22:48:48,221 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-23 22:48:48,222 INFO L440 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-23 22:48:48,222 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-23 22:48:48,222 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-11-23 22:48:48,222 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-23 22:48:48,222 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-23 22:48:48,222 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L320-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-11-23 22:48:48,223 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-23 22:48:48,224 INFO L444 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-23 22:48:48,224 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-23 22:48:48,224 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse6))) [2019-11-23 22:48:48,224 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-23 22:48:48,224 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 490) no Hoare annotation was computed. [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:48:48,225 INFO L447 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-11-23 22:48:48,225 INFO L444 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-23 22:48:48,226 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-11-23 22:48:48,227 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-11-23 22:48:48,227 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-11-23 22:48:48,227 INFO L444 ceAbstractionStarter]: For program point L492(lines 492 498) no Hoare annotation was computed. [2019-11-23 22:48:48,227 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not .cse4)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3))) [2019-11-23 22:48:48,227 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-23 22:48:48,227 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-23 22:48:48,227 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-23 22:48:48,227 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-11-23 22:48:48,228 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-11-23 22:48:48,228 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-11-23 22:48:48,228 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-11-23 22:48:48,228 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-11-23 22:48:48,229 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-23 22:48:48,229 INFO L444 ceAbstractionStarter]: For program point L495-2(lines 207 541) no Hoare annotation was computed. [2019-11-23 22:48:48,229 INFO L440 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-23 22:48:48,229 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-23 22:48:48,229 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)))) [2019-11-23 22:48:48,229 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-11-23 22:48:48,229 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-11-23 22:48:48,230 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-11-23 22:48:48,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:48:48 BoogieIcfgContainer [2019-11-23 22:48:48,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:48:48,283 INFO L168 Benchmark]: Toolchain (without parser) took 31864.41 ms. Allocated memory was 145.2 MB in the beginning and 949.0 MB in the end (delta: 803.7 MB). Free memory was 102.7 MB in the beginning and 417.9 MB in the end (delta: -315.1 MB). Peak memory consumption was 823.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:48,283 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 22:48:48,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.66 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 178.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:48,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.10 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 174.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:48,285 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 202.4 MB. Free memory was 174.7 MB in the beginning and 172.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:48,285 INFO L168 Benchmark]: RCFGBuilder took 960.96 ms. Allocated memory is still 202.4 MB. Free memory was 172.3 MB in the beginning and 120.5 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:48,286 INFO L168 Benchmark]: TraceAbstraction took 30271.68 ms. Allocated memory was 202.4 MB in the beginning and 949.0 MB in the end (delta: 746.6 MB). Free memory was 119.9 MB in the beginning and 417.9 MB in the end (delta: -298.0 MB). Peak memory consumption was 783.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:48,288 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 520.66 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 178.1 MB in the end (delta: -75.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.10 ms. Allocated memory is still 202.4 MB. Free memory was 178.1 MB in the beginning and 174.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 202.4 MB. Free memory was 174.7 MB in the beginning and 172.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 960.96 ms. Allocated memory is still 202.4 MB. Free memory was 172.3 MB in the beginning and 120.5 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30271.68 ms. Allocated memory was 202.4 MB in the beginning and 949.0 MB in the end (delta: 746.6 MB). Free memory was 119.9 MB in the beginning and 417.9 MB in the end (delta: -298.0 MB). Peak memory consumption was 783.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8448) && 0 == s__hit) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 0 == blastFlag) && s__state <= 8448)) || (((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292)) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 12292))) || ((1 == blastFlag && 8672 <= s__state) && !(s__state == 12292))) || ((8672 <= s__state && 0 == blastFlag) && !(s__state == 12292)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || (((((((((!(s__state == 8544) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) || ((((s__state <= 8672 && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && 8448 <= s__state) && s__state <= 8448) || (((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) || (((((s__state <= 8672 && !(s__state == 8656)) && 0 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state == 8608) && 0 == s__hit) || (1 == blastFlag && s__state == 8608)) || (0 == blastFlag && s__state == 8608) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 30.1s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.4s, HoareTripleCheckerStatistics: 6655 SDtfs, 4128 SDslu, 3144 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3545 HoareAnnotationTreeSize, 28 FomulaSimplifications, 146928 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38499 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 9209 NumberOfCodeBlocks, 9209 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9169 ConstructedInterpolants, 0 QuantifiedInterpolants, 3945115 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2970 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...