/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_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:22,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:22,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:22,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:22,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:22,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:22,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:22,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:22,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:22,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:22,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:22,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:22,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:22,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:22,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:22,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:22,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:22,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:22,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:22,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:22,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:22,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:22,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:22,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:22,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:22,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:22,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:22,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:22,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:22,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:22,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:22,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:22,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:22,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:22,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:22,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:22,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:22,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:22,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:22,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:22,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:22,709 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:22,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:22,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:22,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:22,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:22,727 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:22,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:22,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:22,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:22,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:22,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:22,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:22,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:22,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:22,729 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:22,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:22,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:22,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:22,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:22,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:22,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:22,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:22,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:22,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:22,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:22,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:22,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:22,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:22,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:22,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:22,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:23,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:23,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:23,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:23,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:23,019 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:23,020 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-11-23 22:48:23,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8722e2a6/ede852de66134623a0bd71d060525e6c/FLAG18c8d3462 [2019-11-23 22:48:23,543 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:23,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-11-23 22:48:23,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8722e2a6/ede852de66134623a0bd71d060525e6c/FLAG18c8d3462 [2019-11-23 22:48:23,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8722e2a6/ede852de66134623a0bd71d060525e6c [2019-11-23 22:48:23,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:23,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:23,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:23,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:23,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:23,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39236083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:23, skipping insertion in model container [2019-11-23 22:48:23,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:23" (1/1) ... [2019-11-23 22:48:23,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:23,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:24,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:24,237 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:24,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:24,407 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:24,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:24 WrapperNode [2019-11-23 22:48:24,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:24,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:24,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:24,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:24,419 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:24" (1/1) ... [2019-11-23 22:48:24,445 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:24" (1/1) ... [2019-11-23 22:48:24,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:24,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:24,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:24,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:24,535 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:24" (1/1) ... [2019-11-23 22:48:24,535 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:24" (1/1) ... [2019-11-23 22:48:24,550 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:24" (1/1) ... [2019-11-23 22:48:24,551 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:24" (1/1) ... [2019-11-23 22:48:24,569 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:24" (1/1) ... [2019-11-23 22:48:24,587 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:24" (1/1) ... [2019-11-23 22:48:24,592 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:24" (1/1) ... [2019-11-23 22:48:24,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:24,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:24,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:24,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:24,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:24" (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:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:24,825 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:25,597 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:25,597 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:25,599 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:25,599 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:25,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:25 BoogieIcfgContainer [2019-11-23 22:48:25,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:25,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:25,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:25,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:25,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:23" (1/3) ... [2019-11-23 22:48:25,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfdc916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:25, skipping insertion in model container [2019-11-23 22:48:25,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:24" (2/3) ... [2019-11-23 22:48:25,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfdc916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:25, skipping insertion in model container [2019-11-23 22:48:25,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:25" (3/3) ... [2019-11-23 22:48:25,607 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-11-23 22:48:25,617 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:25,625 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:25,635 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:25,662 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:25,662 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:25,662 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:25,663 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:25,663 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:25,663 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:25,663 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:25,663 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-23 22:48:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:48:25,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:25,695 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] [2019-11-23 22:48:25,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707020, now seen corresponding path program 1 times [2019-11-23 22:48:25,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:25,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228757773] [2019-11-23 22:48:25,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:25,984 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:25,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228757773] [2019-11-23 22:48:25,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:25,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:25,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992761029] [2019-11-23 22:48:25,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:25,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:26,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,016 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-23 22:48:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:26,424 INFO L93 Difference]: Finished difference Result 338 states and 585 transitions. [2019-11-23 22:48:26,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:26,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-23 22:48:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:26,442 INFO L225 Difference]: With dead ends: 338 [2019-11-23 22:48:26,442 INFO L226 Difference]: Without dead ends: 179 [2019-11-23 22:48:26,446 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:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-23 22:48:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2019-11-23 22:48:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-23 22:48:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 278 transitions. [2019-11-23 22:48:26,508 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 278 transitions. Word has length 41 [2019-11-23 22:48:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:26,508 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 278 transitions. [2019-11-23 22:48:26,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 278 transitions. [2019-11-23 22:48:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:48:26,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:26,511 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] [2019-11-23 22:48:26,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716333, now seen corresponding path program 1 times [2019-11-23 22:48:26,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:26,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534281463] [2019-11-23 22:48:26,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:26,636 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:26,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534281463] [2019-11-23 22:48:26,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:26,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:26,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273855603] [2019-11-23 22:48:26,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:26,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:26,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:26,641 INFO L87 Difference]: Start difference. First operand 171 states and 278 transitions. Second operand 3 states. [2019-11-23 22:48:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:26,870 INFO L93 Difference]: Finished difference Result 382 states and 630 transitions. [2019-11-23 22:48:26,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:26,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-23 22:48:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:26,874 INFO L225 Difference]: With dead ends: 382 [2019-11-23 22:48:26,874 INFO L226 Difference]: Without dead ends: 218 [2019-11-23 22:48:26,876 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:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-23 22:48:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-11-23 22:48:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-23 22:48:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-23 22:48:26,906 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 42 [2019-11-23 22:48:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:26,907 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-23 22:48:26,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-23 22:48:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 22:48:26,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:26,911 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] [2019-11-23 22:48:26,911 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1839414983, now seen corresponding path program 1 times [2019-11-23 22:48:26,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:26,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609172767] [2019-11-23 22:48:26,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,002 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:27,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609172767] [2019-11-23 22:48:27,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886016104] [2019-11-23 22:48:27,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,006 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-23 22:48:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,217 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-23 22:48:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-23 22:48:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,220 INFO L225 Difference]: With dead ends: 444 [2019-11-23 22:48:27,220 INFO L226 Difference]: Without dead ends: 241 [2019-11-23 22:48:27,222 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:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-23 22:48:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-23 22:48:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-23 22:48:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-23 22:48:27,242 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 69 [2019-11-23 22:48:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,243 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-23 22:48:27,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-23 22:48:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:48:27,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,250 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1554149248, now seen corresponding path program 1 times [2019-11-23 22:48:27,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486489289] [2019-11-23 22:48:27,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:27,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486489289] [2019-11-23 22:48:27,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944903512] [2019-11-23 22:48:27,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,378 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-23 22:48:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,555 INFO L93 Difference]: Finished difference Result 513 states and 872 transitions. [2019-11-23 22:48:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-23 22:48:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,558 INFO L225 Difference]: With dead ends: 513 [2019-11-23 22:48:27,558 INFO L226 Difference]: Without dead ends: 279 [2019-11-23 22:48:27,559 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:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-23 22:48:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-11-23 22:48:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-23 22:48:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 472 transitions. [2019-11-23 22:48:27,577 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 472 transitions. Word has length 74 [2019-11-23 22:48:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,577 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 472 transitions. [2019-11-23 22:48:27,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 472 transitions. [2019-11-23 22:48:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:48:27,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:27,579 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1571310151, now seen corresponding path program 1 times [2019-11-23 22:48:27,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714379444] [2019-11-23 22:48:27,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:27,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714379444] [2019-11-23 22:48:27,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363558482] [2019-11-23 22:48:27,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,652 INFO L87 Difference]: Start difference. First operand 277 states and 472 transitions. Second operand 3 states. [2019-11-23 22:48:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:27,865 INFO L93 Difference]: Finished difference Result 549 states and 935 transitions. [2019-11-23 22:48:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:27,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-23 22:48:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:27,868 INFO L225 Difference]: With dead ends: 549 [2019-11-23 22:48:27,868 INFO L226 Difference]: Without dead ends: 279 [2019-11-23 22:48:27,869 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:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-23 22:48:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-11-23 22:48:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-23 22:48:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 470 transitions. [2019-11-23 22:48:27,880 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 470 transitions. Word has length 75 [2019-11-23 22:48:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:27,880 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 470 transitions. [2019-11-23 22:48:27,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 470 transitions. [2019-11-23 22:48:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 22:48:27,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:27,882 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] [2019-11-23 22:48:27,882 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1779493469, now seen corresponding path program 1 times [2019-11-23 22:48:27,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:27,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373834218] [2019-11-23 22:48:27,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:27,932 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:27,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373834218] [2019-11-23 22:48:27,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:27,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:27,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28002638] [2019-11-23 22:48:27,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:27,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:27,935 INFO L87 Difference]: Start difference. First operand 277 states and 470 transitions. Second operand 3 states. [2019-11-23 22:48:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,061 INFO L93 Difference]: Finished difference Result 564 states and 957 transitions. [2019-11-23 22:48:28,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-23 22:48:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,064 INFO L225 Difference]: With dead ends: 564 [2019-11-23 22:48:28,064 INFO L226 Difference]: Without dead ends: 294 [2019-11-23 22:48:28,065 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:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-23 22:48:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-11-23 22:48:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-23 22:48:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-11-23 22:48:28,075 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 81 [2019-11-23 22:48:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,076 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-11-23 22:48:28,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-11-23 22:48:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:48:28,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,077 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] [2019-11-23 22:48:28,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 685947497, now seen corresponding path program 1 times [2019-11-23 22:48:28,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211772650] [2019-11-23 22:48:28,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,123 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:28,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211772650] [2019-11-23 22:48:28,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644792427] [2019-11-23 22:48:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,132 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 3 states. [2019-11-23 22:48:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,258 INFO L93 Difference]: Finished difference Result 579 states and 975 transitions. [2019-11-23 22:48:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-23 22:48:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,261 INFO L225 Difference]: With dead ends: 579 [2019-11-23 22:48:28,261 INFO L226 Difference]: Without dead ends: 294 [2019-11-23 22:48:28,262 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:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-23 22:48:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-11-23 22:48:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-23 22:48:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 488 transitions. [2019-11-23 22:48:28,278 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 488 transitions. Word has length 82 [2019-11-23 22:48:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,278 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 488 transitions. [2019-11-23 22:48:28,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 488 transitions. [2019-11-23 22:48:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:48:28,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,279 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] [2019-11-23 22:48:28,279 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -166367862, now seen corresponding path program 1 times [2019-11-23 22:48:28,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123828928] [2019-11-23 22:48:28,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,313 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:28,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123828928] [2019-11-23 22:48:28,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760976507] [2019-11-23 22:48:28,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,316 INFO L87 Difference]: Start difference. First operand 292 states and 488 transitions. Second operand 3 states. [2019-11-23 22:48:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,421 INFO L93 Difference]: Finished difference Result 586 states and 977 transitions. [2019-11-23 22:48:28,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 22:48:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,423 INFO L225 Difference]: With dead ends: 586 [2019-11-23 22:48:28,423 INFO L226 Difference]: Without dead ends: 301 [2019-11-23 22:48:28,424 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:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-23 22:48:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-11-23 22:48:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-23 22:48:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 494 transitions. [2019-11-23 22:48:28,434 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 494 transitions. Word has length 94 [2019-11-23 22:48:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,434 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 494 transitions. [2019-11-23 22:48:28,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 494 transitions. [2019-11-23 22:48:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:48:28,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,436 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] [2019-11-23 22:48:28,436 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1087158848, now seen corresponding path program 1 times [2019-11-23 22:48:28,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128859700] [2019-11-23 22:48:28,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,480 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:28,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128859700] [2019-11-23 22:48:28,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864830782] [2019-11-23 22:48:28,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,482 INFO L87 Difference]: Start difference. First operand 301 states and 494 transitions. Second operand 3 states. [2019-11-23 22:48:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,662 INFO L93 Difference]: Finished difference Result 626 states and 1030 transitions. [2019-11-23 22:48:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-23 22:48:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,664 INFO L225 Difference]: With dead ends: 626 [2019-11-23 22:48:28,664 INFO L226 Difference]: Without dead ends: 332 [2019-11-23 22:48:28,665 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:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-23 22:48:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-11-23 22:48:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-23 22:48:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 541 transitions. [2019-11-23 22:48:28,677 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 541 transitions. Word has length 95 [2019-11-23 22:48:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,677 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 541 transitions. [2019-11-23 22:48:28,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 541 transitions. [2019-11-23 22:48:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 22:48:28,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,679 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] [2019-11-23 22:48:28,679 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2088595028, now seen corresponding path program 1 times [2019-11-23 22:48:28,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451498843] [2019-11-23 22:48:28,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,713 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:28,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451498843] [2019-11-23 22:48:28,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714817270] [2019-11-23 22:48:28,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,715 INFO L87 Difference]: Start difference. First operand 330 states and 541 transitions. Second operand 3 states. [2019-11-23 22:48:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:28,864 INFO L93 Difference]: Finished difference Result 655 states and 1073 transitions. [2019-11-23 22:48:28,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:28,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 22:48:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:28,867 INFO L225 Difference]: With dead ends: 655 [2019-11-23 22:48:28,867 INFO L226 Difference]: Without dead ends: 332 [2019-11-23 22:48:28,868 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:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-23 22:48:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-11-23 22:48:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-23 22:48:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 537 transitions. [2019-11-23 22:48:28,880 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 537 transitions. Word has length 96 [2019-11-23 22:48:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:28,881 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 537 transitions. [2019-11-23 22:48:28,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 537 transitions. [2019-11-23 22:48:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:48:28,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,883 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] [2019-11-23 22:48:28,883 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2096161680, now seen corresponding path program 1 times [2019-11-23 22:48:28,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345460038] [2019-11-23 22:48:28,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:28,916 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:28,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345460038] [2019-11-23 22:48:28,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:28,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:28,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678648192] [2019-11-23 22:48:28,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:28,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:28,919 INFO L87 Difference]: Start difference. First operand 330 states and 537 transitions. Second operand 3 states. [2019-11-23 22:48:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,070 INFO L93 Difference]: Finished difference Result 688 states and 1123 transitions. [2019-11-23 22:48:29,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:48:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,073 INFO L225 Difference]: With dead ends: 688 [2019-11-23 22:48:29,073 INFO L226 Difference]: Without dead ends: 365 [2019-11-23 22:48:29,074 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:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-23 22:48:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-11-23 22:48:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-23 22:48:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 579 transitions. [2019-11-23 22:48:29,087 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 579 transitions. Word has length 97 [2019-11-23 22:48:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,087 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 579 transitions. [2019-11-23 22:48:29,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 579 transitions. [2019-11-23 22:48:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:48:29,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,089 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] [2019-11-23 22:48:29,089 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash -297892004, now seen corresponding path program 1 times [2019-11-23 22:48:29,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155849803] [2019-11-23 22:48:29,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,151 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:29,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155849803] [2019-11-23 22:48:29,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556250764] [2019-11-23 22:48:29,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,154 INFO L87 Difference]: Start difference. First operand 357 states and 579 transitions. Second operand 3 states. [2019-11-23 22:48:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,321 INFO L93 Difference]: Finished difference Result 715 states and 1160 transitions. [2019-11-23 22:48:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-23 22:48:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,323 INFO L225 Difference]: With dead ends: 715 [2019-11-23 22:48:29,324 INFO L226 Difference]: Without dead ends: 365 [2019-11-23 22:48:29,324 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:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-23 22:48:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-11-23 22:48:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-23 22:48:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2019-11-23 22:48:29,337 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 98 [2019-11-23 22:48:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,338 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2019-11-23 22:48:29,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2019-11-23 22:48:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:48:29,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,339 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, 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] [2019-11-23 22:48:29,340 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 386381809, now seen corresponding path program 1 times [2019-11-23 22:48:29,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555987091] [2019-11-23 22:48:29,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 22:48:29,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555987091] [2019-11-23 22:48:29,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848352738] [2019-11-23 22:48:29,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,389 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand 3 states. [2019-11-23 22:48:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,547 INFO L93 Difference]: Finished difference Result 743 states and 1195 transitions. [2019-11-23 22:48:29,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:48:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,551 INFO L225 Difference]: With dead ends: 743 [2019-11-23 22:48:29,551 INFO L226 Difference]: Without dead ends: 393 [2019-11-23 22:48:29,552 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:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-23 22:48:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-11-23 22:48:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-23 22:48:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 627 transitions. [2019-11-23 22:48:29,572 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 627 transitions. Word has length 105 [2019-11-23 22:48:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,572 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 627 transitions. [2019-11-23 22:48:29,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 627 transitions. [2019-11-23 22:48:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:48:29,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,574 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, 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] [2019-11-23 22:48:29,574 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1882644280, now seen corresponding path program 1 times [2019-11-23 22:48:29,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050775393] [2019-11-23 22:48:29,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 22:48:29,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050775393] [2019-11-23 22:48:29,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579162118] [2019-11-23 22:48:29,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,639 INFO L87 Difference]: Start difference. First operand 391 states and 627 transitions. Second operand 3 states. [2019-11-23 22:48:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,854 INFO L93 Difference]: Finished difference Result 777 states and 1245 transitions. [2019-11-23 22:48:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 22:48:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,858 INFO L225 Difference]: With dead ends: 777 [2019-11-23 22:48:29,859 INFO L226 Difference]: Without dead ends: 393 [2019-11-23 22:48:29,861 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:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-23 22:48:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-11-23 22:48:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-23 22:48:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 624 transitions. [2019-11-23 22:48:29,877 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 624 transitions. Word has length 106 [2019-11-23 22:48:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,877 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 624 transitions. [2019-11-23 22:48:29,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 624 transitions. [2019-11-23 22:48:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:48:29,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,879 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:29,879 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1260059449, now seen corresponding path program 1 times [2019-11-23 22:48:29,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653008386] [2019-11-23 22:48:29,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:29,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653008386] [2019-11-23 22:48:29,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:29,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521565783] [2019-11-23 22:48:29,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,960 INFO L87 Difference]: Start difference. First operand 391 states and 624 transitions. Second operand 3 states. [2019-11-23 22:48:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,125 INFO L93 Difference]: Finished difference Result 822 states and 1311 transitions. [2019-11-23 22:48:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-23 22:48:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,128 INFO L225 Difference]: With dead ends: 822 [2019-11-23 22:48:30,128 INFO L226 Difference]: Without dead ends: 438 [2019-11-23 22:48:30,131 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:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-23 22:48:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 433. [2019-11-23 22:48:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-23 22:48:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 689 transitions. [2019-11-23 22:48:30,148 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 689 transitions. Word has length 111 [2019-11-23 22:48:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,149 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 689 transitions. [2019-11-23 22:48:30,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 689 transitions. [2019-11-23 22:48:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-23 22:48:30,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,152 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1753706176, now seen corresponding path program 1 times [2019-11-23 22:48:30,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545661189] [2019-11-23 22:48:30,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:30,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545661189] [2019-11-23 22:48:30,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:30,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633131209] [2019-11-23 22:48:30,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,206 INFO L87 Difference]: Start difference. First operand 433 states and 689 transitions. Second operand 3 states. [2019-11-23 22:48:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,378 INFO L93 Difference]: Finished difference Result 868 states and 1382 transitions. [2019-11-23 22:48:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-23 22:48:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,381 INFO L225 Difference]: With dead ends: 868 [2019-11-23 22:48:30,381 INFO L226 Difference]: Without dead ends: 440 [2019-11-23 22:48:30,382 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:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-23 22:48:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2019-11-23 22:48:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-23 22:48:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 692 transitions. [2019-11-23 22:48:30,399 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 692 transitions. Word has length 112 [2019-11-23 22:48:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,399 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 692 transitions. [2019-11-23 22:48:30,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 692 transitions. [2019-11-23 22:48:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-23 22:48:30,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,401 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,401 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 793971013, now seen corresponding path program 1 times [2019-11-23 22:48:30,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752701342] [2019-11-23 22:48:30,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 22:48:30,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752701342] [2019-11-23 22:48:30,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:30,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008086381] [2019-11-23 22:48:30,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,437 INFO L87 Difference]: Start difference. First operand 435 states and 692 transitions. Second operand 3 states. [2019-11-23 22:48:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,586 INFO L93 Difference]: Finished difference Result 901 states and 1437 transitions. [2019-11-23 22:48:30,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-23 22:48:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,589 INFO L225 Difference]: With dead ends: 901 [2019-11-23 22:48:30,590 INFO L226 Difference]: Without dead ends: 473 [2019-11-23 22:48:30,591 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:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-23 22:48:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-11-23 22:48:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-23 22:48:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 727 transitions. [2019-11-23 22:48:30,624 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 727 transitions. Word has length 123 [2019-11-23 22:48:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,624 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 727 transitions. [2019-11-23 22:48:30,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 727 transitions. [2019-11-23 22:48:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-23 22:48:30,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,627 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:30,627 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2143195791, now seen corresponding path program 1 times [2019-11-23 22:48:30,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529310974] [2019-11-23 22:48:30,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 22:48:30,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529310974] [2019-11-23 22:48:30,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:30,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59324147] [2019-11-23 22:48:30,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,663 INFO L87 Difference]: Start difference. First operand 460 states and 727 transitions. Second operand 3 states. [2019-11-23 22:48:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,806 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2019-11-23 22:48:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-23 22:48:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,809 INFO L225 Difference]: With dead ends: 926 [2019-11-23 22:48:30,809 INFO L226 Difference]: Without dead ends: 473 [2019-11-23 22:48:30,810 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:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-23 22:48:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-11-23 22:48:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-23 22:48:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 719 transitions. [2019-11-23 22:48:30,826 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 719 transitions. Word has length 124 [2019-11-23 22:48:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,826 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 719 transitions. [2019-11-23 22:48:30,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 719 transitions. [2019-11-23 22:48:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-23 22:48:30,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,828 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-23 22:48:30,829 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash -418940064, now seen corresponding path program 1 times [2019-11-23 22:48:30,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109823890] [2019-11-23 22:48:30,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 22:48:30,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109823890] [2019-11-23 22:48:30,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:30,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234995065] [2019-11-23 22:48:30,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,866 INFO L87 Difference]: Start difference. First operand 460 states and 719 transitions. Second operand 3 states. [2019-11-23 22:48:31,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,006 INFO L93 Difference]: Finished difference Result 917 states and 1432 transitions. [2019-11-23 22:48:31,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-23 22:48:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,009 INFO L225 Difference]: With dead ends: 917 [2019-11-23 22:48:31,009 INFO L226 Difference]: Without dead ends: 464 [2019-11-23 22:48:31,010 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:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-23 22:48:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-11-23 22:48:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-23 22:48:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 714 transitions. [2019-11-23 22:48:31,025 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 714 transitions. Word has length 136 [2019-11-23 22:48:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,025 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 714 transitions. [2019-11-23 22:48:31,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 714 transitions. [2019-11-23 22:48:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-23 22:48:31,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,028 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 22:48:31,028 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash 307186329, now seen corresponding path program 1 times [2019-11-23 22:48:31,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754113365] [2019-11-23 22:48:31,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 22:48:31,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754113365] [2019-11-23 22:48:31,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:31,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882026746] [2019-11-23 22:48:31,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,069 INFO L87 Difference]: Start difference. First operand 460 states and 714 transitions. Second operand 3 states. [2019-11-23 22:48:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,231 INFO L93 Difference]: Finished difference Result 917 states and 1422 transitions. [2019-11-23 22:48:31,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-23 22:48:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,235 INFO L225 Difference]: With dead ends: 917 [2019-11-23 22:48:31,235 INFO L226 Difference]: Without dead ends: 464 [2019-11-23 22:48:31,236 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:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-23 22:48:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-11-23 22:48:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-23 22:48:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 709 transitions. [2019-11-23 22:48:31,250 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 709 transitions. Word has length 137 [2019-11-23 22:48:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,251 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 709 transitions. [2019-11-23 22:48:31,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 709 transitions. [2019-11-23 22:48:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 22:48:31,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,253 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:31,253 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash 791534820, now seen corresponding path program 1 times [2019-11-23 22:48:31,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131037774] [2019-11-23 22:48:31,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 22:48:31,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131037774] [2019-11-23 22:48:31,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:31,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496820312] [2019-11-23 22:48:31,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,297 INFO L87 Difference]: Start difference. First operand 460 states and 709 transitions. Second operand 3 states. [2019-11-23 22:48:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,462 INFO L93 Difference]: Finished difference Result 941 states and 1452 transitions. [2019-11-23 22:48:31,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-23 22:48:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,466 INFO L225 Difference]: With dead ends: 941 [2019-11-23 22:48:31,466 INFO L226 Difference]: Without dead ends: 488 [2019-11-23 22:48:31,468 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:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-11-23 22:48:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-11-23 22:48:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-23 22:48:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 740 transitions. [2019-11-23 22:48:31,493 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 740 transitions. Word has length 144 [2019-11-23 22:48:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,493 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 740 transitions. [2019-11-23 22:48:31,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 740 transitions. [2019-11-23 22:48:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 22:48:31,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,496 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:31,497 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,497 INFO L82 PathProgramCache]: Analyzing trace with hash -335636264, now seen corresponding path program 1 times [2019-11-23 22:48:31,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717987184] [2019-11-23 22:48:31,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 22:48:31,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717987184] [2019-11-23 22:48:31,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:31,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446110440] [2019-11-23 22:48:31,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,550 INFO L87 Difference]: Start difference. First operand 484 states and 740 transitions. Second operand 3 states. [2019-11-23 22:48:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,744 INFO L93 Difference]: Finished difference Result 965 states and 1474 transitions. [2019-11-23 22:48:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-23 22:48:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,748 INFO L225 Difference]: With dead ends: 965 [2019-11-23 22:48:31,748 INFO L226 Difference]: Without dead ends: 488 [2019-11-23 22:48:31,750 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:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-11-23 22:48:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-11-23 22:48:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-23 22:48:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 731 transitions. [2019-11-23 22:48:31,777 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 731 transitions. Word has length 145 [2019-11-23 22:48:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,778 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 731 transitions. [2019-11-23 22:48:31,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 731 transitions. [2019-11-23 22:48:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:48:31,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,781 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:31,782 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,782 INFO L82 PathProgramCache]: Analyzing trace with hash -122343295, now seen corresponding path program 1 times [2019-11-23 22:48:31,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030166303] [2019-11-23 22:48:31,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-23 22:48:31,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030166303] [2019-11-23 22:48:31,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:31,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001941658] [2019-11-23 22:48:31,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,863 INFO L87 Difference]: Start difference. First operand 484 states and 731 transitions. Second operand 3 states. [2019-11-23 22:48:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,138 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2019-11-23 22:48:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 22:48:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,142 INFO L225 Difference]: With dead ends: 1008 [2019-11-23 22:48:32,143 INFO L226 Difference]: Without dead ends: 531 [2019-11-23 22:48:32,144 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:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-23 22:48:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 525. [2019-11-23 22:48:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-11-23 22:48:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 786 transitions. [2019-11-23 22:48:32,166 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 786 transitions. Word has length 151 [2019-11-23 22:48:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,166 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 786 transitions. [2019-11-23 22:48:32,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 786 transitions. [2019-11-23 22:48:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:48:32,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,171 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2019-11-23 22:48:32,172 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1907415640, now seen corresponding path program 1 times [2019-11-23 22:48:32,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303327589] [2019-11-23 22:48:32,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-23 22:48:32,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303327589] [2019-11-23 22:48:32,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:32,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80743161] [2019-11-23 22:48:32,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,245 INFO L87 Difference]: Start difference. First operand 525 states and 786 transitions. Second operand 3 states. [2019-11-23 22:48:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,457 INFO L93 Difference]: Finished difference Result 1049 states and 1570 transitions. [2019-11-23 22:48:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:48:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,460 INFO L225 Difference]: With dead ends: 1049 [2019-11-23 22:48:32,460 INFO L226 Difference]: Without dead ends: 512 [2019-11-23 22:48:32,462 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:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-23 22:48:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2019-11-23 22:48:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-11-23 22:48:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 756 transitions. [2019-11-23 22:48:32,481 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 756 transitions. Word has length 152 [2019-11-23 22:48:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,482 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 756 transitions. [2019-11-23 22:48:32,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 756 transitions. [2019-11-23 22:48:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 22:48:32,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,486 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 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,486 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1249588557, now seen corresponding path program 1 times [2019-11-23 22:48:32,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511694808] [2019-11-23 22:48:32,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-23 22:48:32,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511694808] [2019-11-23 22:48:32,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:32,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835696232] [2019-11-23 22:48:32,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,532 INFO L87 Difference]: Start difference. First operand 506 states and 756 transitions. Second operand 3 states. [2019-11-23 22:48:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,662 INFO L93 Difference]: Finished difference Result 1030 states and 1542 transitions. [2019-11-23 22:48:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-23 22:48:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,665 INFO L225 Difference]: With dead ends: 1030 [2019-11-23 22:48:32,665 INFO L226 Difference]: Without dead ends: 531 [2019-11-23 22:48:32,667 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:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-23 22:48:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2019-11-23 22:48:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-11-23 22:48:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 780 transitions. [2019-11-23 22:48:32,684 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 780 transitions. Word has length 165 [2019-11-23 22:48:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,685 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 780 transitions. [2019-11-23 22:48:32,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 780 transitions. [2019-11-23 22:48:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 22:48:32,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,687 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 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,687 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1409544545, now seen corresponding path program 1 times [2019-11-23 22:48:32,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189372166] [2019-11-23 22:48:32,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-23 22:48:32,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189372166] [2019-11-23 22:48:32,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:32,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699499426] [2019-11-23 22:48:32,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,756 INFO L87 Difference]: Start difference. First operand 527 states and 780 transitions. Second operand 3 states. [2019-11-23 22:48:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,882 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2019-11-23 22:48:32,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-23 22:48:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,885 INFO L225 Difference]: With dead ends: 1051 [2019-11-23 22:48:32,885 INFO L226 Difference]: Without dead ends: 529 [2019-11-23 22:48:32,886 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:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-11-23 22:48:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 525. [2019-11-23 22:48:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-11-23 22:48:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 766 transitions. [2019-11-23 22:48:32,904 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 766 transitions. Word has length 166 [2019-11-23 22:48:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,904 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 766 transitions. [2019-11-23 22:48:32,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 766 transitions. [2019-11-23 22:48:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 22:48:32,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,907 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 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,907 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1453747987, now seen corresponding path program 1 times [2019-11-23 22:48:32,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823971449] [2019-11-23 22:48:32,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-23 22:48:32,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823971449] [2019-11-23 22:48:32,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583824820] [2019-11-23 22:48:32,991 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:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:33,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-11-23 22:48:33,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:33,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:33,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281851176] [2019-11-23 22:48:33,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:33,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:33,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:33,236 INFO L87 Difference]: Start difference. First operand 525 states and 766 transitions. Second operand 3 states. [2019-11-23 22:48:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,352 INFO L93 Difference]: Finished difference Result 1559 states and 2275 transitions. [2019-11-23 22:48:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-23 22:48:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,359 INFO L225 Difference]: With dead ends: 1559 [2019-11-23 22:48:33,359 INFO L226 Difference]: Without dead ends: 1041 [2019-11-23 22:48:33,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-11-23 22:48:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2019-11-23 22:48:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-11-23 22:48:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1512 transitions. [2019-11-23 22:48:33,411 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1512 transitions. Word has length 181 [2019-11-23 22:48:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,412 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 1512 transitions. [2019-11-23 22:48:33,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1512 transitions. [2019-11-23 22:48:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 22:48:33,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,416 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:33,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:33,631 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676108, now seen corresponding path program 1 times [2019-11-23 22:48:33,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931258884] [2019-11-23 22:48:33,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 22:48:33,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931258884] [2019-11-23 22:48:33,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:33,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:33,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437490246] [2019-11-23 22:48:33,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:33,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:33,818 INFO L87 Difference]: Start difference. First operand 1041 states and 1512 transitions. Second operand 3 states. [2019-11-23 22:48:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,959 INFO L93 Difference]: Finished difference Result 2585 states and 3758 transitions. [2019-11-23 22:48:33,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-23 22:48:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,970 INFO L225 Difference]: With dead ends: 2585 [2019-11-23 22:48:33,970 INFO L226 Difference]: Without dead ends: 1551 [2019-11-23 22:48:33,973 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,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2019-11-23 22:48:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2019-11-23 22:48:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2019-11-23 22:48:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2248 transitions. [2019-11-23 22:48:34,068 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2248 transitions. Word has length 188 [2019-11-23 22:48:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,069 INFO L462 AbstractCegarLoop]: Abstraction has 1551 states and 2248 transitions. [2019-11-23 22:48:34,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2248 transitions. [2019-11-23 22:48:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-23 22:48:34,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:34,077 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:34,077 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash -373781024, now seen corresponding path program 1 times [2019-11-23 22:48:34,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:34,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935057610] [2019-11-23 22:48:34,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 22:48:34,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935057610] [2019-11-23 22:48:34,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:34,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:34,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964083001] [2019-11-23 22:48:34,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:34,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:34,187 INFO L87 Difference]: Start difference. First operand 1551 states and 2248 transitions. Second operand 3 states. [2019-11-23 22:48:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,332 INFO L93 Difference]: Finished difference Result 3606 states and 5231 transitions. [2019-11-23 22:48:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:34,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-23 22:48:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,342 INFO L225 Difference]: With dead ends: 3606 [2019-11-23 22:48:34,343 INFO L226 Difference]: Without dead ends: 2062 [2019-11-23 22:48:34,347 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:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-11-23 22:48:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2019-11-23 22:48:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2019-11-23 22:48:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2985 transitions. [2019-11-23 22:48:34,428 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2985 transitions. Word has length 189 [2019-11-23 22:48:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,428 INFO L462 AbstractCegarLoop]: Abstraction has 2062 states and 2985 transitions. [2019-11-23 22:48:34,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2985 transitions. [2019-11-23 22:48:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-23 22:48:34,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:34,437 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 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] [2019-11-23 22:48:34,437 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:34,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1948421128, now seen corresponding path program 1 times [2019-11-23 22:48:34,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:34,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569908013] [2019-11-23 22:48:34,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-23 22:48:34,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569908013] [2019-11-23 22:48:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:34,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:34,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890946959] [2019-11-23 22:48:34,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:34,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:34,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:34,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:34,673 INFO L87 Difference]: Start difference. First operand 2062 states and 2985 transitions. Second operand 3 states. [2019-11-23 22:48:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,786 INFO L93 Difference]: Finished difference Result 5692 states and 8229 transitions. [2019-11-23 22:48:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:34,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-11-23 22:48:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,803 INFO L225 Difference]: With dead ends: 5692 [2019-11-23 22:48:34,804 INFO L226 Difference]: Without dead ends: 3637 [2019-11-23 22:48:34,807 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:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2019-11-23 22:48:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2019-11-23 22:48:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-11-23 22:48:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5245 transitions. [2019-11-23 22:48:34,939 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5245 transitions. Word has length 338 [2019-11-23 22:48:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,940 INFO L462 AbstractCegarLoop]: Abstraction has 3635 states and 5245 transitions. [2019-11-23 22:48:34,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5245 transitions. [2019-11-23 22:48:34,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-23 22:48:34,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:34,951 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 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, 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:34,951 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1969862083, now seen corresponding path program 1 times [2019-11-23 22:48:34,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:34,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949153128] [2019-11-23 22:48:34,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-11-23 22:48:35,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949153128] [2019-11-23 22:48:35,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:35,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:35,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572270268] [2019-11-23 22:48:35,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:35,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:35,197 INFO L87 Difference]: Start difference. First operand 3635 states and 5245 transitions. Second operand 3 states. [2019-11-23 22:48:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:35,466 INFO L93 Difference]: Finished difference Result 7423 states and 10735 transitions. [2019-11-23 22:48:35,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:35,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-23 22:48:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:35,477 INFO L225 Difference]: With dead ends: 7423 [2019-11-23 22:48:35,477 INFO L226 Difference]: Without dead ends: 2498 [2019-11-23 22:48:35,483 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:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-11-23 22:48:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498. [2019-11-23 22:48:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-11-23 22:48:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3552 transitions. [2019-11-23 22:48:35,574 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3552 transitions. Word has length 375 [2019-11-23 22:48:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:35,574 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3552 transitions. [2019-11-23 22:48:35,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3552 transitions. [2019-11-23 22:48:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-23 22:48:35,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:35,587 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 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:35,587 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:35,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 943000906, now seen corresponding path program 1 times [2019-11-23 22:48:35,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:35,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833354027] [2019-11-23 22:48:35,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-23 22:48:35,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833354027] [2019-11-23 22:48:35,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034546225] [2019-11-23 22:48:35,802 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:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:35,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:35,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-11-23 22:48:36,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:36,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:36,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212754379] [2019-11-23 22:48:36,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:36,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:36,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:36,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:36,354 INFO L87 Difference]: Start difference. First operand 2498 states and 3552 transitions. Second operand 3 states. [2019-11-23 22:48:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:36,422 INFO L93 Difference]: Finished difference Result 2558 states and 3638 transitions. [2019-11-23 22:48:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:36,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-11-23 22:48:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:36,432 INFO L225 Difference]: With dead ends: 2558 [2019-11-23 22:48:36,432 INFO L226 Difference]: Without dead ends: 2069 [2019-11-23 22:48:36,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 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:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-23 22:48:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2011. [2019-11-23 22:48:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-11-23 22:48:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2860 transitions. [2019-11-23 22:48:36,504 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2860 transitions. Word has length 441 [2019-11-23 22:48:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:36,505 INFO L462 AbstractCegarLoop]: Abstraction has 2011 states and 2860 transitions. [2019-11-23 22:48:36,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2860 transitions. [2019-11-23 22:48:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-23 22:48:36,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:36,515 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 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, 1, 1] [2019-11-23 22:48:36,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:36,720 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1896941064, now seen corresponding path program 1 times [2019-11-23 22:48:36,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:36,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236903618] [2019-11-23 22:48:36,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-23 22:48:36,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236903618] [2019-11-23 22:48:36,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842057481] [2019-11-23 22:48:36,889 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:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:37,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:37,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-11-23 22:48:37,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:37,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:37,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205705657] [2019-11-23 22:48:37,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:37,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:37,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:37,197 INFO L87 Difference]: Start difference. First operand 2011 states and 2860 transitions. Second operand 3 states. [2019-11-23 22:48:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:37,310 INFO L93 Difference]: Finished difference Result 4484 states and 6387 transitions. [2019-11-23 22:48:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:37,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-11-23 22:48:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:37,328 INFO L225 Difference]: With dead ends: 4484 [2019-11-23 22:48:37,328 INFO L226 Difference]: Without dead ends: 2480 [2019-11-23 22:48:37,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 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:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-23 22:48:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2480. [2019-11-23 22:48:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2480 states. [2019-11-23 22:48:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3528 transitions. [2019-11-23 22:48:37,423 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3528 transitions. Word has length 441 [2019-11-23 22:48:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:37,424 INFO L462 AbstractCegarLoop]: Abstraction has 2480 states and 3528 transitions. [2019-11-23 22:48:37,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3528 transitions. [2019-11-23 22:48:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-11-23 22:48:37,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:37,436 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 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, 1, 1, 1] [2019-11-23 22:48:37,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:37,642 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -699120285, now seen corresponding path program 1 times [2019-11-23 22:48:37,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:37,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979058802] [2019-11-23 22:48:37,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-23 22:48:37,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979058802] [2019-11-23 22:48:37,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504444126] [2019-11-23 22:48:37,887 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:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:38,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:38,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-11-23 22:48:38,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:38,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:38,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962297998] [2019-11-23 22:48:38,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:38,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:38,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:38,115 INFO L87 Difference]: Start difference. First operand 2480 states and 3528 transitions. Second operand 3 states. [2019-11-23 22:48:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:38,236 INFO L93 Difference]: Finished difference Result 5462 states and 7775 transitions. [2019-11-23 22:48:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:38,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-11-23 22:48:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:38,244 INFO L225 Difference]: With dead ends: 5462 [2019-11-23 22:48:38,244 INFO L226 Difference]: Without dead ends: 2989 [2019-11-23 22:48:38,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 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:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-11-23 22:48:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2989. [2019-11-23 22:48:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-11-23 22:48:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4248 transitions. [2019-11-23 22:48:38,354 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4248 transitions. Word has length 442 [2019-11-23 22:48:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:38,355 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 4248 transitions. [2019-11-23 22:48:38,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4248 transitions. [2019-11-23 22:48:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-11-23 22:48:38,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:38,364 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-23 22:48:38,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:38,577 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash -517858284, now seen corresponding path program 1 times [2019-11-23 22:48:38,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:38,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112900470] [2019-11-23 22:48:38,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-11-23 22:48:38,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112900470] [2019-11-23 22:48:38,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345905994] [2019-11-23 22:48:38,761 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:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:38,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:38,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-11-23 22:48:39,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:39,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:39,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776901830] [2019-11-23 22:48:39,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:39,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:39,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:39,010 INFO L87 Difference]: Start difference. First operand 2989 states and 4248 transitions. Second operand 3 states. [2019-11-23 22:48:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:39,168 INFO L93 Difference]: Finished difference Result 6439 states and 9162 transitions. [2019-11-23 22:48:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:39,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-11-23 22:48:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:39,175 INFO L225 Difference]: With dead ends: 6439 [2019-11-23 22:48:39,176 INFO L226 Difference]: Without dead ends: 3457 [2019-11-23 22:48:39,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 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:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-11-23 22:48:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3457. [2019-11-23 22:48:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2019-11-23 22:48:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4915 transitions. [2019-11-23 22:48:39,295 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4915 transitions. Word has length 443 [2019-11-23 22:48:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:39,295 INFO L462 AbstractCegarLoop]: Abstraction has 3457 states and 4915 transitions. [2019-11-23 22:48:39,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4915 transitions. [2019-11-23 22:48:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-11-23 22:48:39,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:39,305 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:39,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:39,509 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1394872725, now seen corresponding path program 1 times [2019-11-23 22:48:39,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:39,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461730034] [2019-11-23 22:48:39,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-23 22:48:39,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461730034] [2019-11-23 22:48:39,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194643426] [2019-11-23 22:48:39,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:39,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:39,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-11-23 22:48:40,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:40,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:40,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430977915] [2019-11-23 22:48:40,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:40,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:40,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:40,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:40,111 INFO L87 Difference]: Start difference. First operand 3457 states and 4915 transitions. Second operand 4 states. [2019-11-23 22:48:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:40,381 INFO L93 Difference]: Finished difference Result 6879 states and 9779 transitions. [2019-11-23 22:48:40,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:40,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 594 [2019-11-23 22:48:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:40,387 INFO L225 Difference]: With dead ends: 6879 [2019-11-23 22:48:40,388 INFO L226 Difference]: Without dead ends: 3352 [2019-11-23 22:48:40,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 596 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:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-11-23 22:48:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3092. [2019-11-23 22:48:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-11-23 22:48:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-11-23 22:48:40,477 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 594 [2019-11-23 22:48:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:40,477 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-11-23 22:48:40,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-11-23 22:48:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-11-23 22:48:40,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:40,493 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:40,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:40,706 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1182493111, now seen corresponding path program 1 times [2019-11-23 22:48:40,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:40,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452386345] [2019-11-23 22:48:40,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-11-23 22:48:41,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452386345] [2019-11-23 22:48:41,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225929852] [2019-11-23 22:48:41,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:41,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:41,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-11-23 22:48:42,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:42,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:48:42,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303282617] [2019-11-23 22:48:42,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:42,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:42,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:42,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:42,022 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 4 states. [2019-11-23 22:48:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:42,305 INFO L93 Difference]: Finished difference Result 7201 states and 9931 transitions. [2019-11-23 22:48:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:42,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1014 [2019-11-23 22:48:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:42,313 INFO L225 Difference]: With dead ends: 7201 [2019-11-23 22:48:42,313 INFO L226 Difference]: Without dead ends: 3932 [2019-11-23 22:48:42,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 1016 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:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-11-23 22:48:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3092. [2019-11-23 22:48:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-11-23 22:48:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-11-23 22:48:42,403 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 1014 [2019-11-23 22:48:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:42,404 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-11-23 22:48:42,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-11-23 22:48:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1265 [2019-11-23 22:48:42,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:42,422 INFO L410 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:42,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:42,629 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash 283829187, now seen corresponding path program 1 times [2019-11-23 22:48:42,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:42,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419400354] [2019-11-23 22:48:42,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-11-23 22:48:43,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419400354] [2019-11-23 22:48:43,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:43,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:43,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612316651] [2019-11-23 22:48:43,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:43,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:43,640 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 3 states. [2019-11-23 22:48:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:43,813 INFO L93 Difference]: Finished difference Result 6327 states and 8667 transitions. [2019-11-23 22:48:43,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:43,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1264 [2019-11-23 22:48:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:43,820 INFO L225 Difference]: With dead ends: 6327 [2019-11-23 22:48:43,821 INFO L226 Difference]: Without dead ends: 3218 [2019-11-23 22:48:43,824 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:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2019-11-23 22:48:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3148. [2019-11-23 22:48:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-11-23 22:48:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4298 transitions. [2019-11-23 22:48:43,907 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4298 transitions. Word has length 1264 [2019-11-23 22:48:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:43,908 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 4298 transitions. [2019-11-23 22:48:43,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4298 transitions. [2019-11-23 22:48:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-11-23 22:48:43,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:43,926 INFO L410 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:43,926 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash 515038815, now seen corresponding path program 1 times [2019-11-23 22:48:43,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:43,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613756980] [2019-11-23 22:48:43,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-11-23 22:48:44,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613756980] [2019-11-23 22:48:44,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:44,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:44,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821262332] [2019-11-23 22:48:44,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:44,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:44,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:44,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:44,792 INFO L87 Difference]: Start difference. First operand 3148 states and 4298 transitions. Second operand 3 states. [2019-11-23 22:48:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:44,927 INFO L93 Difference]: Finished difference Result 4148 states and 5651 transitions. [2019-11-23 22:48:44,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:44,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1294 [2019-11-23 22:48:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:44,928 INFO L225 Difference]: With dead ends: 4148 [2019-11-23 22:48:44,928 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:48:44,932 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:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:48:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:48:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:48:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:48:44,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1294 [2019-11-23 22:48:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:44,933 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:48:44,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:48:44,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:48:44,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:48:45,626 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-11-23 22:48:46,160 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-11-23 22:48:46,898 WARN L192 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-11-23 22:48:47,085 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-23 22:48:47,781 WARN L192 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-23 22:48:48,550 WARN L192 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-23 22:48:49,670 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2019-11-23 22:48:50,515 WARN L192 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-11-23 22:48:51,310 WARN L192 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-11-23 22:48:52,296 WARN L192 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-11-23 22:48:52,922 WARN L192 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2019-11-23 22:48:53,839 WARN L192 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-23 22:48:54,488 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-11-23 22:48:54,929 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-23 22:48:55,684 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2019-11-23 22:48:56,452 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-23 22:48:56,828 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-23 22:48:57,557 WARN L192 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-23 22:48:58,598 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-11-23 22:48:59,310 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-23 22:49:00,020 WARN L192 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-23 22:49:00,418 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-23 22:49:01,339 WARN L192 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-11-23 22:49:01,342 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 501) no Hoare annotation was computed. [2019-11-23 22:49:01,342 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-23 22:49:01,342 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-23 22:49:01,343 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-23 22:49:01,344 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27))) [2019-11-23 22:49:01,344 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 601) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-11-23 22:49:01,345 INFO L447 ceAbstractionStarter]: At program point L631(lines 10 633) the Hoare annotation is: true [2019-11-23 22:49:01,345 INFO L440 ceAbstractionStarter]: At program point L565(lines 98 620) the Hoare annotation is: (let ((.cse22 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse12 (not .cse22)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse9 .cse10) (and .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse12) (and .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse20 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse2 .cse15 .cse3 .cse5 .cse17 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse18 .cse19 .cse10 .cse4 .cse6 .cse9 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 .cse22)))) [2019-11-23 22:49:01,345 INFO L444 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2019-11-23 22:49:01,345 INFO L444 ceAbstractionStarter]: For program point L533-2(lines 207 564) no Hoare annotation was computed. [2019-11-23 22:49:01,345 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 567) no Hoare annotation was computed. [2019-11-23 22:49:01,345 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 578) no Hoare annotation was computed. [2019-11-23 22:49:01,345 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 589) no Hoare annotation was computed. [2019-11-23 22:49:01,345 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 600) no Hoare annotation was computed. [2019-11-23 22:49:01,346 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-23 22:49:01,346 INFO L444 ceAbstractionStarter]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-23 22:49:01,346 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 567) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-23 22:49:01,346 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 579) the Hoare annotation is: (let ((.cse29 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not .cse29))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse4 .cse26 .cse5 .cse6 .cse7 .cse20 .cse9 .cse27 .cse10 .cse11 .cse13 .cse22 .cse23 .cse15 .cse28 .cse24) (and .cse4 .cse26 .cse5 .cse6 .cse7 .cse20 .cse29 .cse9 .cse27 .cse10 .cse11 .cse13 .cse22 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2019-11-23 22:49:01,346 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 590) the Hoare annotation is: (let ((.cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse21 .cse12 .cse22 .cse23 .cse24 .cse25 .cse5 .cse26 .cse10 .cse14 .cse27) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse4 .cse19 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse21 .cse22 .cse23 .cse24 .cse25 .cse5 .cse26 .cse10 .cse14 .cse27) (and .cse28 .cse15 .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse21 .cse22 .cse23 .cse24 .cse25 .cse5 .cse26 .cse10 .cse14 .cse27))) [2019-11-23 22:49:01,346 INFO L444 ceAbstractionStarter]: For program point L602(lines 602 618) no Hoare annotation was computed. [2019-11-23 22:49:01,346 INFO L444 ceAbstractionStarter]: For program point L503(lines 503 513) no Hoare annotation was computed. [2019-11-23 22:49:01,346 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 567) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 577) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 588) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 599) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 617) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 564) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2019-11-23 22:49:01,347 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 603 617) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 512) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 576) no Hoare annotation was computed. [2019-11-23 22:49:01,348 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 587) no Hoare annotation was computed. [2019-11-23 22:49:01,349 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 598) no Hoare annotation was computed. [2019-11-23 22:49:01,349 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 608) no Hoare annotation was computed. [2019-11-23 22:49:01,349 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 484) no Hoare annotation was computed. [2019-11-23 22:49:01,349 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-23 22:49:01,349 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-23 22:49:01,349 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 600) the Hoare annotation is: (let ((.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse29 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-11-23 22:49:01,350 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 577) the Hoare annotation is: (let ((.cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (not .cse20)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2019-11-23 22:49:01,350 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 588) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse25 (not .cse28)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse26 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 .cse27 .cse24) (and .cse26 .cse5 .cse6 .cse20 .cse28 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse24)))) [2019-11-23 22:49:01,350 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-23 22:49:01,350 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-23 22:49:01,351 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 546) no Hoare annotation was computed. [2019-11-23 22:49:01,351 INFO L444 ceAbstractionStarter]: For program point L509(lines 509 511) no Hoare annotation was computed. [2019-11-23 22:49:01,351 INFO L444 ceAbstractionStarter]: For program point L542-2(lines 542 546) no Hoare annotation was computed. [2019-11-23 22:49:01,351 INFO L444 ceAbstractionStarter]: For program point L509-2(lines 207 564) no Hoare annotation was computed. [2019-11-23 22:49:01,351 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 575) no Hoare annotation was computed. [2019-11-23 22:49:01,351 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 586) no Hoare annotation was computed. [2019-11-23 22:49:01,352 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 597) no Hoare annotation was computed. [2019-11-23 22:49:01,352 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 483) no Hoare annotation was computed. [2019-11-23 22:49:01,352 INFO L444 ceAbstractionStarter]: For program point L477-2(lines 207 564) no Hoare annotation was computed. [2019-11-23 22:49:01,352 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:49:01,353 INFO L447 ceAbstractionStarter]: At program point L643(lines 634 645) the Hoare annotation is: true [2019-11-23 22:49:01,353 INFO L444 ceAbstractionStarter]: For program point L611(lines 611 615) no Hoare annotation was computed. [2019-11-23 22:49:01,353 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-23 22:49:01,353 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:49:01,355 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 574) no Hoare annotation was computed. [2019-11-23 22:49:01,355 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 585) no Hoare annotation was computed. [2019-11-23 22:49:01,355 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-23 22:49:01,355 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 596) no Hoare annotation was computed. [2019-11-23 22:49:01,355 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 482) no Hoare annotation was computed. [2019-11-23 22:49:01,356 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 575) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2019-11-23 22:49:01,356 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 586) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse5 .cse6 .cse26 .cse7 .cse20 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 .cse27 .cse24) (and .cse5 .cse26 .cse6 .cse7 .cse20 .cse28 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse22 .cse13 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2019-11-23 22:49:01,356 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-23 22:49:01,356 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-23 22:49:01,356 INFO L440 ceAbstractionStarter]: At program point L481(lines 71 632) the Hoare annotation is: false [2019-11-23 22:49:01,356 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-23 22:49:01,357 INFO L440 ceAbstractionStarter]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse5 .cse6 .cse26 .cse7 .cse20 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 .cse27 .cse24) (and .cse5 .cse26 .cse6 .cse7 .cse20 .cse28 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse22 .cse13 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2019-11-23 22:49:01,357 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:49:01,357 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 573) no Hoare annotation was computed. [2019-11-23 22:49:01,357 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 584) no Hoare annotation was computed. [2019-11-23 22:49:01,357 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 595) no Hoare annotation was computed. [2019-11-23 22:49:01,357 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-23 22:49:01,358 INFO L440 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse26 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse21 .cse13 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse23) (and .cse28 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse21 .cse13 .cse22 .cse15 .cse27 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-23 22:49:01,358 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 596) the Hoare annotation is: (let ((.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse28 (not .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse4 .cse20 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse21 .cse12 .cse22 .cse14 .cse23 .cse24 .cse25 .cse26 .cse5 .cse27 .cse11 .cse13 .cse28) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse29 .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse4 .cse20 .cse7 .cse9 .cse10 .cse21 .cse12 .cse22 .cse14 .cse23 .cse24 .cse25 .cse26 .cse5 .cse27 .cse11 .cse13 .cse28)))) [2019-11-23 22:49:01,358 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-23 22:49:01,358 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-23 22:49:01,358 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 207 564) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L320-2(lines 207 564) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 572) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 583) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 594) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 632) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 558) no Hoare annotation was computed. [2019-11-23 22:49:01,359 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 522) no Hoare annotation was computed. [2019-11-23 22:49:01,360 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 552 558) no Hoare annotation was computed. [2019-11-23 22:49:01,360 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-23 22:49:01,360 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 573) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse27))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28)))) [2019-11-23 22:49:01,360 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 584) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse26 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse21 .cse13 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse23) (and .cse28 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse21 .cse13 .cse22 .cse15 .cse27 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-23 22:49:01,361 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 594) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-23 22:49:01,361 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-23 22:49:01,361 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-23 22:49:01,361 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:49:01,361 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2019-11-23 22:49:01,361 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 492) no Hoare annotation was computed. [2019-11-23 22:49:01,361 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 571) no Hoare annotation was computed. [2019-11-23 22:49:01,361 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 582) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 593) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L447 ceAbstractionStarter]: At program point L621(lines 97 622) the Hoare annotation is: true [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 564) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-23 22:49:01,362 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:49:01,363 INFO L444 ceAbstractionStarter]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-23 22:49:01,363 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-23 22:49:01,363 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 570) no Hoare annotation was computed. [2019-11-23 22:49:01,363 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 581) no Hoare annotation was computed. [2019-11-23 22:49:01,363 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 592) no Hoare annotation was computed. [2019-11-23 22:49:01,363 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 571) the Hoare annotation is: (let ((.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse26 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse27 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24))) [2019-11-23 22:49:01,364 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 582) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse4 .cse5 .cse26 .cse6 .cse19 .cse8 .cse9 .cse11 .cse21 .cse12 .cse22 .cse14 .cse27 .cse23) (and .cse4 .cse26 .cse5 .cse6 .cse19 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse8 .cse9 .cse11 .cse21 .cse12 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse27 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-23 22:49:01,365 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2019-11-23 22:49:01,365 INFO L444 ceAbstractionStarter]: For program point L626-2(lines 626 628) no Hoare annotation was computed. [2019-11-23 22:49:01,366 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 537) no Hoare annotation was computed. [2019-11-23 22:49:01,366 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-23 22:49:01,366 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-23 22:49:01,366 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 569) no Hoare annotation was computed. [2019-11-23 22:49:01,367 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 580) no Hoare annotation was computed. [2019-11-23 22:49:01,367 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 591) no Hoare annotation was computed. [2019-11-23 22:49:01,367 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 620) the Hoare annotation is: (let ((.cse22 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse12 (not .cse22)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse9 .cse10) (and .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse12) (and .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse20 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse2 .cse15 .cse3 .cse5 .cse17 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse18 .cse19 .cse10 .cse4 .cse6 .cse9 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 .cse22)))) [2019-11-23 22:49:01,367 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2019-11-23 22:49:01,368 INFO L440 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse26 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse21 .cse13 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse23) (and .cse28 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse21 .cse13 .cse22 .cse15 .cse27 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-11-23 22:49:01,368 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-23 22:49:01,368 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 580) the Hoare annotation is: (let ((.cse30 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse26 (not .cse30)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse27 .cse28 .cse29) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse28 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse29 .cse30) (and .cse5 .cse6 .cse7 .cse8 .cse22 .cse30 .cse10 .cse11 .cse12 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse15 .cse24 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse25)))) [2019-11-23 22:49:01,369 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 593) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse29 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse30 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse22 .cse10 .cse12 .cse23 .cse14 .cse24 .cse25 .cse26 .cse27 .cse6 .cse28 .cse11 .cse13 .cse16 .cse29) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse12 .cse23 .cse30 .cse14 .cse24 .cse25 .cse26 .cse27 .cse6 .cse28 .cse11 .cse13 .cse16 .cse29) (and .cse0 .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse12 .cse23 .cse14 .cse24 .cse25 .cse26 .cse27 .cse6 .cse28 .cse11 .cse13 .cse16 .cse29) (and .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16))) [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 568) no Hoare annotation was computed. [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 579) no Hoare annotation was computed. [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 590) no Hoare annotation was computed. [2019-11-23 22:49:01,369 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 601) no Hoare annotation was computed. [2019-11-23 22:49:01,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:49:01 BoogieIcfgContainer [2019-11-23 22:49:01,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:49:01,469 INFO L168 Benchmark]: Toolchain (without parser) took 37570.48 ms. Allocated memory was 146.3 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 102.6 MB in the beginning and 385.7 MB in the end (delta: -283.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-11-23 22:49:01,470 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 22:49:01,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.83 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 178.7 MB in the end (delta: -76.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:01,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.64 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 176.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:01,471 INFO L168 Benchmark]: Boogie Preprocessor took 78.03 ms. Allocated memory is still 203.4 MB. Free memory was 176.0 MB in the beginning and 173.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:01,471 INFO L168 Benchmark]: RCFGBuilder took 1000.81 ms. Allocated memory is still 203.4 MB. Free memory was 173.0 MB in the beginning and 119.7 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:01,471 INFO L168 Benchmark]: TraceAbstraction took 35866.30 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 119.7 MB in the beginning and 385.7 MB in the end (delta: -266.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-11-23 22:49:01,473 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 507.83 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 178.7 MB in the end (delta: -76.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 112.64 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 176.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.03 ms. Allocated memory is still 203.4 MB. Free memory was 176.0 MB in the beginning and 173.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1000.81 ms. Allocated memory is still 203.4 MB. Free memory was 173.0 MB in the beginning and 119.7 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35866.30 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 119.7 MB in the beginning and 385.7 MB in the end (delta: -266.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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: 634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((8448 <= s__state && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && 0 == s__hit) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 3 == blastFlag) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((s__state <= 3 || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (4 == blastFlag && !(0 == s__hit))) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292))) || (blastFlag <= 2 && !(0 == s__hit))) || (((4 == blastFlag && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((!(s__state == 8577) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292)) && 0 == s__hit) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8608) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit))) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && 3 == blastFlag) && s__state <= 8448) && 0 == s__hit)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((s__state <= 3 || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (4 == blastFlag && !(0 == s__hit))) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292))) || (blastFlag <= 2 && !(0 == s__hit))) || (((4 == blastFlag && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((!(s__state == 8577) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292)) && 0 == s__hit) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Result: SAFE, OverallTime: 35.7s, OverallIterations: 39, TraceHistogramMax: 46, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.4s, HoareTripleCheckerStatistics: 7425 SDtfs, 5594 SDslu, 2523 SDs, 0 SdLazy, 3264 SolverSat, 1331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3651 GetRequests, 3598 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 1350 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 271 NumberOfFragments, 7979 HoareAnnotationTreeSize, 28 FomulaSimplifications, 40550 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 10733 FormulaSimplificationTreeSizeReductionInter, 15.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 13581 NumberOfCodeBlocks, 13581 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 13535 ConstructedInterpolants, 0 QuantifiedInterpolants, 9879497 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5422 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 92901/93135 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...