./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb8d19eba9f796d5d2cd9125ad944b1aceff9e2d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:08:45,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:08:45,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:08:45,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:08:45,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:08:45,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:08:45,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:08:45,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:08:45,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:08:45,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:08:45,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:08:45,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:08:45,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:08:45,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:08:45,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:08:45,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:08:45,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:08:45,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:08:45,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:08:45,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:08:45,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:08:45,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:08:45,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:08:45,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:08:45,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:08:45,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:08:45,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:08:45,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:08:45,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:08:45,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:08:45,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:08:45,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:08:45,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:08:45,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:08:45,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:08:45,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:08:45,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:08:45,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:08:45,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:08:45,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:08:45,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:08:45,583 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:08:45,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:08:45,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:08:45,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:08:45,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:08:45,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:08:45,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:08:45,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:08:45,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:08:45,586 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:08:45,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:08:45,586 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:08:45,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:08:45,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:08:45,589 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:08:45,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:08:45,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:08:45,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:08:45,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:08:45,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:08:45,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:08:45,591 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:08:45,591 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:08:45,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:08:45,593 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb8d19eba9f796d5d2cd9125ad944b1aceff9e2d [2018-12-30 16:08:45,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:08:45,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:08:45,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:08:45,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:08:45,683 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:08:45,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_true-unreach-call_false-termination.cil.c [2018-12-30 16:08:45,753 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b587bb474/8d559d953b9d452f9249ea8a3837ba71/FLAG35e94fdf5 [2018-12-30 16:08:46,254 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:08:46,255 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_true-unreach-call_false-termination.cil.c [2018-12-30 16:08:46,276 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b587bb474/8d559d953b9d452f9249ea8a3837ba71/FLAG35e94fdf5 [2018-12-30 16:08:46,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b587bb474/8d559d953b9d452f9249ea8a3837ba71 [2018-12-30 16:08:46,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:08:46,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:08:46,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:46,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:08:46,576 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:08:46,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:46" (1/1) ... [2018-12-30 16:08:46,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76052153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:46, skipping insertion in model container [2018-12-30 16:08:46,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:08:46" (1/1) ... [2018-12-30 16:08:46,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:08:46,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:08:46,935 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:46,946 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:08:47,029 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:08:47,051 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:08:47,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47 WrapperNode [2018-12-30 16:08:47,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:08:47,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:47,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:08:47,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:08:47,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:08:47,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:08:47,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:08:47,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:08:47,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (1/1) ... [2018-12-30 16:08:47,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:08:47,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:08:47,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:08:47,251 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:08:47,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (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 [2018-12-30 16:08:47,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:08:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:08:47,456 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:08:47,457 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:08:48,508 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:08:48,508 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 16:08:48,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:48 BoogieIcfgContainer [2018-12-30 16:08:48,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:08:48,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:08:48,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:08:48,513 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:08:48,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:08:46" (1/3) ... [2018-12-30 16:08:48,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f4b017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:48, skipping insertion in model container [2018-12-30 16:08:48,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:08:47" (2/3) ... [2018-12-30 16:08:48,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f4b017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:08:48, skipping insertion in model container [2018-12-30 16:08:48,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:48" (3/3) ... [2018-12-30 16:08:48,517 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1_true-unreach-call_false-termination.cil.c [2018-12-30 16:08:48,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:08:48,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:08:48,553 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:08:48,587 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:08:48,588 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:08:48,588 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:08:48,588 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:08:48,590 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:08:48,590 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:08:48,590 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:08:48,590 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:08:48,591 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:08:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-12-30 16:08:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 16:08:48,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:48,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:48,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126418, now seen corresponding path program 1 times [2018-12-30 16:08:48,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:48,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:48,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:48,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:48,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:48,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:48,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:48,934 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2018-12-30 16:08:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:49,678 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2018-12-30 16:08:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:49,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-30 16:08:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:49,697 INFO L225 Difference]: With dead ends: 332 [2018-12-30 16:08:49,697 INFO L226 Difference]: Without dead ends: 177 [2018-12-30 16:08:49,701 INFO L631 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 [2018-12-30 16:08:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-30 16:08:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2018-12-30 16:08:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-30 16:08:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2018-12-30 16:08:49,762 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2018-12-30 16:08:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:49,762 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2018-12-30 16:08:49,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2018-12-30 16:08:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-30 16:08:49,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:49,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:49,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296619, now seen corresponding path program 1 times [2018-12-30 16:08:49,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:49,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:49,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:49,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:49,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:49,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:49,864 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2018-12-30 16:08:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:50,277 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2018-12-30 16:08:50,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:50,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-30 16:08:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:50,285 INFO L225 Difference]: With dead ends: 384 [2018-12-30 16:08:50,285 INFO L226 Difference]: Without dead ends: 218 [2018-12-30 16:08:50,287 INFO L631 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 [2018-12-30 16:08:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-30 16:08:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2018-12-30 16:08:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-30 16:08:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2018-12-30 16:08:50,309 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2018-12-30 16:08:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:50,312 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2018-12-30 16:08:50,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2018-12-30 16:08:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-30 16:08:50,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:50,318 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:50,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash -128378241, now seen corresponding path program 1 times [2018-12-30 16:08:50,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:50,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:50,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:50,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:50,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:50,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:50,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:50,443 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2018-12-30 16:08:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:50,845 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2018-12-30 16:08:50,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:50,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-30 16:08:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:50,850 INFO L225 Difference]: With dead ends: 448 [2018-12-30 16:08:50,850 INFO L226 Difference]: Without dead ends: 243 [2018-12-30 16:08:50,852 INFO L631 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 [2018-12-30 16:08:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-30 16:08:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-12-30 16:08:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-30 16:08:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2018-12-30 16:08:50,871 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2018-12-30 16:08:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:50,872 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2018-12-30 16:08:50,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2018-12-30 16:08:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:08:50,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:50,880 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:50,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1989171317, now seen corresponding path program 1 times [2018-12-30 16:08:50,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:50,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:51,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:51,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:51,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:51,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:51,005 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2018-12-30 16:08:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:51,318 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2018-12-30 16:08:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:51,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:08:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:51,323 INFO L225 Difference]: With dead ends: 525 [2018-12-30 16:08:51,323 INFO L226 Difference]: Without dead ends: 289 [2018-12-30 16:08:51,324 INFO L631 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 [2018-12-30 16:08:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-30 16:08:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2018-12-30 16:08:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-30 16:08:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2018-12-30 16:08:51,343 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2018-12-30 16:08:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:51,344 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2018-12-30 16:08:51,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2018-12-30 16:08:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-30 16:08:51,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:51,348 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:51,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash -575477867, now seen corresponding path program 1 times [2018-12-30 16:08:51,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:51,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:51,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:51,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:08:51,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:51,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:51,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:51,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:51,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:51,418 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2018-12-30 16:08:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:51,626 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2018-12-30 16:08:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:51,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-30 16:08:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:51,628 INFO L225 Difference]: With dead ends: 580 [2018-12-30 16:08:51,629 INFO L226 Difference]: Without dead ends: 302 [2018-12-30 16:08:51,629 INFO L631 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 [2018-12-30 16:08:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-30 16:08:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-12-30 16:08:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-30 16:08:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2018-12-30 16:08:51,646 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2018-12-30 16:08:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:51,646 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2018-12-30 16:08:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2018-12-30 16:08:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-30 16:08:51,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:51,649 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:51,649 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1339419474, now seen corresponding path program 1 times [2018-12-30 16:08:51,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:51,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:08:51,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:51,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:51,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:51,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:51,765 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2018-12-30 16:08:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:52,315 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2018-12-30 16:08:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:52,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-30 16:08:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:52,319 INFO L225 Difference]: With dead ends: 597 [2018-12-30 16:08:52,319 INFO L226 Difference]: Without dead ends: 302 [2018-12-30 16:08:52,320 INFO L631 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 [2018-12-30 16:08:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-30 16:08:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2018-12-30 16:08:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-30 16:08:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2018-12-30 16:08:52,334 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2018-12-30 16:08:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:52,334 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2018-12-30 16:08:52,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2018-12-30 16:08:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-30 16:08:52,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:52,337 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:52,337 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1069928865, now seen corresponding path program 1 times [2018-12-30 16:08:52,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:52,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:52,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:08:52,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:52,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:52,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:52,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:52,419 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2018-12-30 16:08:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:52,956 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2018-12-30 16:08:52,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:52,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-30 16:08:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:52,960 INFO L225 Difference]: With dead ends: 591 [2018-12-30 16:08:52,960 INFO L226 Difference]: Without dead ends: 300 [2018-12-30 16:08:52,961 INFO L631 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 [2018-12-30 16:08:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-30 16:08:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2018-12-30 16:08:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-30 16:08:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2018-12-30 16:08:52,982 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2018-12-30 16:08:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:52,982 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2018-12-30 16:08:52,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2018-12-30 16:08:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-30 16:08:52,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:52,984 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:52,984 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash 608007676, now seen corresponding path program 1 times [2018-12-30 16:08:52,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:52,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-30 16:08:53,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:53,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:53,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:53,075 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2018-12-30 16:08:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:53,499 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2018-12-30 16:08:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:53,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-30 16:08:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:53,502 INFO L225 Difference]: With dead ends: 598 [2018-12-30 16:08:53,503 INFO L226 Difference]: Without dead ends: 307 [2018-12-30 16:08:53,503 INFO L631 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 [2018-12-30 16:08:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-30 16:08:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-12-30 16:08:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-30 16:08:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2018-12-30 16:08:53,521 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2018-12-30 16:08:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:53,523 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2018-12-30 16:08:53,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2018-12-30 16:08:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-30 16:08:53,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:53,526 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:53,526 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1349389816, now seen corresponding path program 1 times [2018-12-30 16:08:53,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:53,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:53,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:08:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:53,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:53,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:53,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:53,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:53,636 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2018-12-30 16:08:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:54,536 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2018-12-30 16:08:54,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:54,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-30 16:08:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:54,539 INFO L225 Difference]: With dead ends: 638 [2018-12-30 16:08:54,539 INFO L226 Difference]: Without dead ends: 338 [2018-12-30 16:08:54,540 INFO L631 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 [2018-12-30 16:08:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-12-30 16:08:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2018-12-30 16:08:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-30 16:08:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2018-12-30 16:08:54,551 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2018-12-30 16:08:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:54,551 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2018-12-30 16:08:54,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2018-12-30 16:08:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 16:08:54,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:54,553 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:54,553 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:54,554 INFO L82 PathProgramCache]: Analyzing trace with hash 206720868, now seen corresponding path program 1 times [2018-12-30 16:08:54,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:54,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:08:54,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:54,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:54,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:54,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:54,600 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2018-12-30 16:08:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:54,905 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2018-12-30 16:08:54,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:54,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-30 16:08:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:54,908 INFO L225 Difference]: With dead ends: 667 [2018-12-30 16:08:54,908 INFO L226 Difference]: Without dead ends: 338 [2018-12-30 16:08:54,909 INFO L631 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 [2018-12-30 16:08:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-12-30 16:08:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2018-12-30 16:08:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-30 16:08:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2018-12-30 16:08:54,920 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2018-12-30 16:08:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:54,920 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2018-12-30 16:08:54,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2018-12-30 16:08:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-30 16:08:54,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:54,922 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:54,922 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1011601848, now seen corresponding path program 1 times [2018-12-30 16:08:54,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:54,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:54,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:54,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:08:54,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:54,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:54,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:54,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:54,978 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2018-12-30 16:08:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:55,830 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2018-12-30 16:08:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:55,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-30 16:08:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:55,834 INFO L225 Difference]: With dead ends: 700 [2018-12-30 16:08:55,834 INFO L226 Difference]: Without dead ends: 371 [2018-12-30 16:08:55,836 INFO L631 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 [2018-12-30 16:08:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-30 16:08:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2018-12-30 16:08:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-30 16:08:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2018-12-30 16:08:55,850 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2018-12-30 16:08:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:55,850 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2018-12-30 16:08:55,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2018-12-30 16:08:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-30 16:08:55,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:55,853 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:55,853 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:55,854 INFO L82 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2018-12-30 16:08:55,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:55,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:55,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:08:55,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:55,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:55,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:55,934 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2018-12-30 16:08:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:56,448 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2018-12-30 16:08:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:56,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-30 16:08:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:56,451 INFO L225 Difference]: With dead ends: 727 [2018-12-30 16:08:56,452 INFO L226 Difference]: Without dead ends: 371 [2018-12-30 16:08:56,454 INFO L631 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 [2018-12-30 16:08:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-30 16:08:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2018-12-30 16:08:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-30 16:08:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2018-12-30 16:08:56,466 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2018-12-30 16:08:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:56,466 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2018-12-30 16:08:56,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2018-12-30 16:08:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 16:08:56,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:56,468 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:56,468 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:56,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1360340166, now seen corresponding path program 1 times [2018-12-30 16:08:56,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:56,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:08:56,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:56,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:56,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:56,568 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2018-12-30 16:08:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:57,387 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2018-12-30 16:08:57,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:57,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 16:08:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:57,390 INFO L225 Difference]: With dead ends: 744 [2018-12-30 16:08:57,390 INFO L226 Difference]: Without dead ends: 388 [2018-12-30 16:08:57,391 INFO L631 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 [2018-12-30 16:08:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-30 16:08:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2018-12-30 16:08:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-30 16:08:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2018-12-30 16:08:57,405 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2018-12-30 16:08:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:57,406 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2018-12-30 16:08:57,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2018-12-30 16:08:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-30 16:08:57,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:57,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:57,408 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash -241831246, now seen corresponding path program 1 times [2018-12-30 16:08:57,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:57,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:57,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:57,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:08:57,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:57,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:57,485 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2018-12-30 16:08:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:57,979 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2018-12-30 16:08:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:57,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-12-30 16:08:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:57,983 INFO L225 Difference]: With dead ends: 765 [2018-12-30 16:08:57,984 INFO L226 Difference]: Without dead ends: 388 [2018-12-30 16:08:57,985 INFO L631 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 [2018-12-30 16:08:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-30 16:08:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2018-12-30 16:08:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-30 16:08:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2018-12-30 16:08:57,995 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2018-12-30 16:08:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:57,996 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2018-12-30 16:08:57,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2018-12-30 16:08:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 16:08:57,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:57,997 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:57,998 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1868043870, now seen corresponding path program 1 times [2018-12-30 16:08:57,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:57,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:57,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-30 16:08:58,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:58,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:58,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:58,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:58,088 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2018-12-30 16:08:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:58,330 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2018-12-30 16:08:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:58,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 16:08:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:58,339 INFO L225 Difference]: With dead ends: 1092 [2018-12-30 16:08:58,339 INFO L226 Difference]: Without dead ends: 715 [2018-12-30 16:08:58,340 INFO L631 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 [2018-12-30 16:08:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-12-30 16:08:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2018-12-30 16:08:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-12-30 16:08:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2018-12-30 16:08:58,366 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2018-12-30 16:08:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:58,366 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2018-12-30 16:08:58,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2018-12-30 16:08:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 16:08:58,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:58,373 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:08:58,373 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash 181343972, now seen corresponding path program 1 times [2018-12-30 16:08:58,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:58,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 16:08:58,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:58,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:08:58,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:58,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:58,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:58,483 INFO L87 Difference]: Start difference. First operand 715 states and 1127 transitions. Second operand 3 states. [2018-12-30 16:08:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:08:58,838 INFO L93 Difference]: Finished difference Result 1798 states and 2838 transitions. [2018-12-30 16:08:58,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:08:58,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 16:08:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:08:58,844 INFO L225 Difference]: With dead ends: 1798 [2018-12-30 16:08:58,844 INFO L226 Difference]: Without dead ends: 1090 [2018-12-30 16:08:58,845 INFO L631 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 [2018-12-30 16:08:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-12-30 16:08:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2018-12-30 16:08:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-12-30 16:08:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1720 transitions. [2018-12-30 16:08:58,878 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1720 transitions. Word has length 121 [2018-12-30 16:08:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:08:58,879 INFO L480 AbstractCegarLoop]: Abstraction has 1090 states and 1720 transitions. [2018-12-30 16:08:58,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:08:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1720 transitions. [2018-12-30 16:08:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-30 16:08:58,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:08:58,882 INFO L402 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, 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] [2018-12-30 16:08:58,882 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:08:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:08:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash -956252537, now seen corresponding path program 1 times [2018-12-30 16:08:58,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:08:58,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:08:58,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:08:58,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:08:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:08:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:08:58,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:08:58,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:08:58,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:08:58,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:08:58,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:08:58,986 INFO L87 Difference]: Start difference. First operand 1090 states and 1720 transitions. Second operand 3 states. [2018-12-30 16:09:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:00,189 INFO L93 Difference]: Finished difference Result 2299 states and 3632 transitions. [2018-12-30 16:09:00,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:00,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-12-30 16:09:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:00,195 INFO L225 Difference]: With dead ends: 2299 [2018-12-30 16:09:00,195 INFO L226 Difference]: Without dead ends: 1216 [2018-12-30 16:09:00,196 INFO L631 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 [2018-12-30 16:09:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2018-12-30 16:09:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2018-12-30 16:09:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-12-30 16:09:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1898 transitions. [2018-12-30 16:09:00,232 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1898 transitions. Word has length 122 [2018-12-30 16:09:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:00,232 INFO L480 AbstractCegarLoop]: Abstraction has 1204 states and 1898 transitions. [2018-12-30 16:09:00,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1898 transitions. [2018-12-30 16:09:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-30 16:09:00,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:00,235 INFO L402 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, 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] [2018-12-30 16:09:00,235 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:00,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:00,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1998579872, now seen corresponding path program 1 times [2018-12-30 16:09:00,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:00,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:00,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:00,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:00,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:00,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:00,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:00,319 INFO L87 Difference]: Start difference. First operand 1204 states and 1898 transitions. Second operand 3 states. [2018-12-30 16:09:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:02,224 INFO L93 Difference]: Finished difference Result 2413 states and 3802 transitions. [2018-12-30 16:09:02,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:02,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-30 16:09:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:02,230 INFO L225 Difference]: With dead ends: 2413 [2018-12-30 16:09:02,230 INFO L226 Difference]: Without dead ends: 1210 [2018-12-30 16:09:02,232 INFO L631 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 [2018-12-30 16:09:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2018-12-30 16:09:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1198. [2018-12-30 16:09:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2018-12-30 16:09:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1881 transitions. [2018-12-30 16:09:02,265 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1881 transitions. Word has length 123 [2018-12-30 16:09:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:02,265 INFO L480 AbstractCegarLoop]: Abstraction has 1198 states and 1881 transitions. [2018-12-30 16:09:02,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1881 transitions. [2018-12-30 16:09:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-30 16:09:02,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:02,268 INFO L402 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, 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, 1, 1, 1] [2018-12-30 16:09:02,269 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash 496982003, now seen corresponding path program 1 times [2018-12-30 16:09:02,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:02,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:02,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:02,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-30 16:09:02,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:02,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:02,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:02,359 INFO L87 Difference]: Start difference. First operand 1198 states and 1881 transitions. Second operand 3 states. [2018-12-30 16:09:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:02,770 INFO L93 Difference]: Finished difference Result 2503 states and 3931 transitions. [2018-12-30 16:09:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:02,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-12-30 16:09:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:02,781 INFO L225 Difference]: With dead ends: 2503 [2018-12-30 16:09:02,782 INFO L226 Difference]: Without dead ends: 1312 [2018-12-30 16:09:02,784 INFO L631 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 [2018-12-30 16:09:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-12-30 16:09:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2018-12-30 16:09:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2018-12-30 16:09:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2044 transitions. [2018-12-30 16:09:02,825 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2044 transitions. Word has length 155 [2018-12-30 16:09:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:02,826 INFO L480 AbstractCegarLoop]: Abstraction has 1306 states and 2044 transitions. [2018-12-30 16:09:02,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2044 transitions. [2018-12-30 16:09:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-30 16:09:02,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:02,831 INFO L402 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, 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, 1, 1, 1] [2018-12-30 16:09:02,831 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1762620122, now seen corresponding path program 1 times [2018-12-30 16:09:02,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:02,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:02,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:02,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-30 16:09:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:02,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:02,942 INFO L87 Difference]: Start difference. First operand 1306 states and 2044 transitions. Second operand 3 states. [2018-12-30 16:09:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:03,930 INFO L93 Difference]: Finished difference Result 2611 states and 4083 transitions. [2018-12-30 16:09:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:03,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-12-30 16:09:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:03,935 INFO L225 Difference]: With dead ends: 2611 [2018-12-30 16:09:03,935 INFO L226 Difference]: Without dead ends: 1306 [2018-12-30 16:09:03,937 INFO L631 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 [2018-12-30 16:09:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2018-12-30 16:09:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2018-12-30 16:09:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-12-30 16:09:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2024 transitions. [2018-12-30 16:09:03,973 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2024 transitions. Word has length 156 [2018-12-30 16:09:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:03,973 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 2024 transitions. [2018-12-30 16:09:03,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2024 transitions. [2018-12-30 16:09:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-30 16:09:03,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:03,978 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2018-12-30 16:09:03,978 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1655718978, now seen corresponding path program 1 times [2018-12-30 16:09:03,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:03,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:03,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:03,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:03,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-12-30 16:09:04,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:04,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:04,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:04,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:04,050 INFO L87 Difference]: Start difference. First operand 1300 states and 2024 transitions. Second operand 3 states. [2018-12-30 16:09:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:04,291 INFO L93 Difference]: Finished difference Result 2701 states and 4205 transitions. [2018-12-30 16:09:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:04,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-12-30 16:09:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:04,296 INFO L225 Difference]: With dead ends: 2701 [2018-12-30 16:09:04,296 INFO L226 Difference]: Without dead ends: 1408 [2018-12-30 16:09:04,298 INFO L631 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 [2018-12-30 16:09:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-12-30 16:09:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1402. [2018-12-30 16:09:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2018-12-30 16:09:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2018-12-30 16:09:04,335 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 186 [2018-12-30 16:09:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:04,335 INFO L480 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2018-12-30 16:09:04,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2018-12-30 16:09:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-30 16:09:04,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:04,340 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2018-12-30 16:09:04,340 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:04,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:04,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1614779429, now seen corresponding path program 1 times [2018-12-30 16:09:04,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:04,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:04,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:04,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-12-30 16:09:04,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:04,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:04,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:04,391 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 3 states. [2018-12-30 16:09:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:04,616 INFO L93 Difference]: Finished difference Result 2803 states and 4339 transitions. [2018-12-30 16:09:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:04,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-12-30 16:09:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:04,624 INFO L225 Difference]: With dead ends: 2803 [2018-12-30 16:09:04,625 INFO L226 Difference]: Without dead ends: 1402 [2018-12-30 16:09:04,626 INFO L631 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 [2018-12-30 16:09:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-12-30 16:09:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1396. [2018-12-30 16:09:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-12-30 16:09:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2149 transitions. [2018-12-30 16:09:04,665 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2149 transitions. Word has length 187 [2018-12-30 16:09:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:04,665 INFO L480 AbstractCegarLoop]: Abstraction has 1396 states and 2149 transitions. [2018-12-30 16:09:04,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2149 transitions. [2018-12-30 16:09:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-30 16:09:04,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:04,669 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1] [2018-12-30 16:09:04,670 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:04,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:04,670 INFO L82 PathProgramCache]: Analyzing trace with hash -848280398, now seen corresponding path program 1 times [2018-12-30 16:09:04,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:04,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:04,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:04,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:04,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-12-30 16:09:04,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:04,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:04,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:04,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:04,753 INFO L87 Difference]: Start difference. First operand 1396 states and 2149 transitions. Second operand 3 states. [2018-12-30 16:09:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:04,992 INFO L93 Difference]: Finished difference Result 2899 states and 4473 transitions. [2018-12-30 16:09:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:04,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-12-30 16:09:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:04,998 INFO L225 Difference]: With dead ends: 2899 [2018-12-30 16:09:04,998 INFO L226 Difference]: Without dead ends: 1510 [2018-12-30 16:09:04,999 INFO L631 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 [2018-12-30 16:09:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-30 16:09:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2018-12-30 16:09:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-12-30 16:09:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2246 transitions. [2018-12-30 16:09:05,038 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2246 transitions. Word has length 205 [2018-12-30 16:09:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:05,038 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 2246 transitions. [2018-12-30 16:09:05,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2246 transitions. [2018-12-30 16:09:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-30 16:09:05,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:05,043 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1] [2018-12-30 16:09:05,043 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1187572258, now seen corresponding path program 1 times [2018-12-30 16:09:05,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:05,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:05,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:05,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:05,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-12-30 16:09:05,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:05,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:05,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:05,138 INFO L87 Difference]: Start difference. First operand 1471 states and 2246 transitions. Second operand 3 states. [2018-12-30 16:09:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:06,135 INFO L93 Difference]: Finished difference Result 2974 states and 4544 transitions. [2018-12-30 16:09:06,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:06,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-12-30 16:09:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:06,144 INFO L225 Difference]: With dead ends: 2974 [2018-12-30 16:09:06,144 INFO L226 Difference]: Without dead ends: 1510 [2018-12-30 16:09:06,146 INFO L631 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 [2018-12-30 16:09:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-30 16:09:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2018-12-30 16:09:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-12-30 16:09:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2220 transitions. [2018-12-30 16:09:06,186 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2220 transitions. Word has length 206 [2018-12-30 16:09:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:06,187 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 2220 transitions. [2018-12-30 16:09:06,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2220 transitions. [2018-12-30 16:09:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-30 16:09:06,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:06,191 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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] [2018-12-30 16:09:06,191 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash -778811277, now seen corresponding path program 1 times [2018-12-30 16:09:06,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:06,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:06,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-12-30 16:09:06,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:06,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:06,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:06,291 INFO L87 Difference]: Start difference. First operand 1471 states and 2220 transitions. Second operand 3 states. [2018-12-30 16:09:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:06,806 INFO L93 Difference]: Finished difference Result 2947 states and 4444 transitions. [2018-12-30 16:09:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:06,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-12-30 16:09:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:06,818 INFO L225 Difference]: With dead ends: 2947 [2018-12-30 16:09:06,818 INFO L226 Difference]: Without dead ends: 1483 [2018-12-30 16:09:06,820 INFO L631 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 [2018-12-30 16:09:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-12-30 16:09:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2018-12-30 16:09:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-12-30 16:09:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2018-12-30 16:09:06,861 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 217 [2018-12-30 16:09:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:06,861 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2018-12-30 16:09:06,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2018-12-30 16:09:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-30 16:09:06,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:06,866 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2018-12-30 16:09:06,867 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1333590618, now seen corresponding path program 1 times [2018-12-30 16:09:06,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:06,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:06,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-12-30 16:09:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:06,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:06,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:06,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:06,960 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand 3 states. [2018-12-30 16:09:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:07,142 INFO L93 Difference]: Finished difference Result 2947 states and 4410 transitions. [2018-12-30 16:09:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:07,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-12-30 16:09:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:07,148 INFO L225 Difference]: With dead ends: 2947 [2018-12-30 16:09:07,148 INFO L226 Difference]: Without dead ends: 1456 [2018-12-30 16:09:07,149 INFO L631 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 [2018-12-30 16:09:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2018-12-30 16:09:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1444. [2018-12-30 16:09:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-12-30 16:09:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2147 transitions. [2018-12-30 16:09:07,188 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2147 transitions. Word has length 218 [2018-12-30 16:09:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:07,188 INFO L480 AbstractCegarLoop]: Abstraction has 1444 states and 2147 transitions. [2018-12-30 16:09:07,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2147 transitions. [2018-12-30 16:09:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-30 16:09:07,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:07,193 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:07,193 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:07,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:07,194 INFO L82 PathProgramCache]: Analyzing trace with hash 193493261, now seen corresponding path program 1 times [2018-12-30 16:09:07,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:07,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:07,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-12-30 16:09:07,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:07,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:07,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:07,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:07,285 INFO L87 Difference]: Start difference. First operand 1444 states and 2147 transitions. Second operand 3 states. [2018-12-30 16:09:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:07,919 INFO L93 Difference]: Finished difference Result 2962 states and 4409 transitions. [2018-12-30 16:09:07,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:07,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-12-30 16:09:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:07,930 INFO L225 Difference]: With dead ends: 2962 [2018-12-30 16:09:07,930 INFO L226 Difference]: Without dead ends: 1525 [2018-12-30 16:09:07,932 INFO L631 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 [2018-12-30 16:09:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-12-30 16:09:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1513. [2018-12-30 16:09:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-12-30 16:09:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2018-12-30 16:09:07,975 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 226 [2018-12-30 16:09:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:07,975 INFO L480 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2018-12-30 16:09:07,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2018-12-30 16:09:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-30 16:09:07,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:07,980 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:07,980 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:07,980 INFO L82 PathProgramCache]: Analyzing trace with hash -831258623, now seen corresponding path program 1 times [2018-12-30 16:09:07,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:07,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-12-30 16:09:08,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:08,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:08,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:08,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:08,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:08,131 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand 3 states. [2018-12-30 16:09:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:08,312 INFO L93 Difference]: Finished difference Result 3031 states and 4462 transitions. [2018-12-30 16:09:08,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:08,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-12-30 16:09:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:08,317 INFO L225 Difference]: With dead ends: 3031 [2018-12-30 16:09:08,317 INFO L226 Difference]: Without dead ends: 1513 [2018-12-30 16:09:08,319 INFO L631 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 [2018-12-30 16:09:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2018-12-30 16:09:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1501. [2018-12-30 16:09:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2018-12-30 16:09:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2182 transitions. [2018-12-30 16:09:08,349 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2182 transitions. Word has length 227 [2018-12-30 16:09:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:08,349 INFO L480 AbstractCegarLoop]: Abstraction has 1501 states and 2182 transitions. [2018-12-30 16:09:08,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2182 transitions. [2018-12-30 16:09:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-30 16:09:08,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:08,351 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:08,352 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:08,352 INFO L82 PathProgramCache]: Analyzing trace with hash 225623806, now seen corresponding path program 1 times [2018-12-30 16:09:08,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:08,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:08,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:08,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:08,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-12-30 16:09:08,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:08,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:08,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:08,445 INFO L87 Difference]: Start difference. First operand 1501 states and 2182 transitions. Second operand 3 states. [2018-12-30 16:09:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:08,493 INFO L93 Difference]: Finished difference Result 3052 states and 4439 transitions. [2018-12-30 16:09:08,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:08,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2018-12-30 16:09:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:08,500 INFO L225 Difference]: With dead ends: 3052 [2018-12-30 16:09:08,500 INFO L226 Difference]: Without dead ends: 1558 [2018-12-30 16:09:08,503 INFO L631 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 [2018-12-30 16:09:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2018-12-30 16:09:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2018-12-30 16:09:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-12-30 16:09:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2266 transitions. [2018-12-30 16:09:08,539 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2266 transitions. Word has length 263 [2018-12-30 16:09:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:08,539 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2266 transitions. [2018-12-30 16:09:08,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2266 transitions. [2018-12-30 16:09:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-30 16:09:08,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:08,542 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:08,542 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1710298052, now seen corresponding path program 1 times [2018-12-30 16:09:08,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:08,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:08,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2018-12-30 16:09:08,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:08,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:08,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:08,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:08,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:08,638 INFO L87 Difference]: Start difference. First operand 1558 states and 2266 transitions. Second operand 3 states. [2018-12-30 16:09:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:08,716 INFO L93 Difference]: Finished difference Result 3142 states and 4569 transitions. [2018-12-30 16:09:08,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:08,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2018-12-30 16:09:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:08,726 INFO L225 Difference]: With dead ends: 3142 [2018-12-30 16:09:08,726 INFO L226 Difference]: Without dead ends: 1591 [2018-12-30 16:09:08,729 INFO L631 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 [2018-12-30 16:09:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-12-30 16:09:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2018-12-30 16:09:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-12-30 16:09:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2313 transitions. [2018-12-30 16:09:08,766 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2313 transitions. Word has length 263 [2018-12-30 16:09:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:08,766 INFO L480 AbstractCegarLoop]: Abstraction has 1591 states and 2313 transitions. [2018-12-30 16:09:08,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2313 transitions. [2018-12-30 16:09:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-12-30 16:09:08,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:08,769 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:08,769 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1900040589, now seen corresponding path program 1 times [2018-12-30 16:09:08,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:08,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:08,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:08,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-30 16:09:08,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:08,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:08,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:08,921 INFO L87 Difference]: Start difference. First operand 1591 states and 2313 transitions. Second operand 3 states. [2018-12-30 16:09:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:09,148 INFO L93 Difference]: Finished difference Result 4612 states and 6703 transitions. [2018-12-30 16:09:09,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:09,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-12-30 16:09:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:09,157 INFO L225 Difference]: With dead ends: 4612 [2018-12-30 16:09:09,157 INFO L226 Difference]: Without dead ends: 3061 [2018-12-30 16:09:09,160 INFO L631 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 [2018-12-30 16:09:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2018-12-30 16:09:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3059. [2018-12-30 16:09:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2018-12-30 16:09:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4438 transitions. [2018-12-30 16:09:09,297 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4438 transitions. Word has length 271 [2018-12-30 16:09:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:09,298 INFO L480 AbstractCegarLoop]: Abstraction has 3059 states and 4438 transitions. [2018-12-30 16:09:09,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4438 transitions. [2018-12-30 16:09:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-30 16:09:09,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:09,305 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:09:09,306 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 999895398, now seen corresponding path program 1 times [2018-12-30 16:09:09,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:09,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-30 16:09:09,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:09,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:09,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:09,450 INFO L87 Difference]: Start difference. First operand 3059 states and 4438 transitions. Second operand 3 states. [2018-12-30 16:09:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:09,720 INFO L93 Difference]: Finished difference Result 6291 states and 9153 transitions. [2018-12-30 16:09:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:09,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-12-30 16:09:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:09,724 INFO L225 Difference]: With dead ends: 6291 [2018-12-30 16:09:09,724 INFO L226 Difference]: Without dead ends: 2043 [2018-12-30 16:09:09,728 INFO L631 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 [2018-12-30 16:09:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2018-12-30 16:09:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2023. [2018-12-30 16:09:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2018-12-30 16:09:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2884 transitions. [2018-12-30 16:09:09,778 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2884 transitions. Word has length 308 [2018-12-30 16:09:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:09,779 INFO L480 AbstractCegarLoop]: Abstraction has 2023 states and 2884 transitions. [2018-12-30 16:09:09,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2884 transitions. [2018-12-30 16:09:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-30 16:09:09,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:09,782 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:09,782 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash -531219143, now seen corresponding path program 1 times [2018-12-30 16:09:09,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:09,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:09,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:09,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-12-30 16:09:09,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:09,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:09:09,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:10,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2018-12-30 16:09:10,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:09:10,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:09:10,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:09:10,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:09:10,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:10,440 INFO L87 Difference]: Start difference. First operand 2023 states and 2884 transitions. Second operand 5 states. [2018-12-30 16:09:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:11,356 INFO L93 Difference]: Finished difference Result 5365 states and 7620 transitions. [2018-12-30 16:09:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:09:11,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 375 [2018-12-30 16:09:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:11,365 INFO L225 Difference]: With dead ends: 5365 [2018-12-30 16:09:11,365 INFO L226 Difference]: Without dead ends: 3294 [2018-12-30 16:09:11,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:09:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2018-12-30 16:09:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2606. [2018-12-30 16:09:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2606 states. [2018-12-30 16:09:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3582 transitions. [2018-12-30 16:09:11,443 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3582 transitions. Word has length 375 [2018-12-30 16:09:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:11,443 INFO L480 AbstractCegarLoop]: Abstraction has 2606 states and 3582 transitions. [2018-12-30 16:09:11,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:09:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3582 transitions. [2018-12-30 16:09:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-12-30 16:09:11,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:11,453 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:09:11,453 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash 306967968, now seen corresponding path program 1 times [2018-12-30 16:09:11,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:11,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:11,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:11,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5025 backedges. 3008 proven. 26 refuted. 0 times theorem prover too weak. 1991 trivial. 0 not checked. [2018-12-30 16:09:11,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:11,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:09:11,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:11,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5025 backedges. 1445 proven. 0 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2018-12-30 16:09:12,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:09:12,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:09:12,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:09:12,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:09:12,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:12,404 INFO L87 Difference]: Start difference. First operand 2606 states and 3582 transitions. Second operand 5 states. [2018-12-30 16:09:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:12,807 INFO L93 Difference]: Finished difference Result 5320 states and 7337 transitions. [2018-12-30 16:09:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:09:12,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 674 [2018-12-30 16:09:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:12,815 INFO L225 Difference]: With dead ends: 5320 [2018-12-30 16:09:12,815 INFO L226 Difference]: Without dead ends: 2659 [2018-12-30 16:09:12,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:09:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2018-12-30 16:09:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 1935. [2018-12-30 16:09:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2018-12-30 16:09:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2018-12-30 16:09:12,883 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 674 [2018-12-30 16:09:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:12,884 INFO L480 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2018-12-30 16:09:12,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:09:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2018-12-30 16:09:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2018-12-30 16:09:12,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:12,898 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:12,899 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1537607748, now seen corresponding path program 1 times [2018-12-30 16:09:12,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:12,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2018-12-30 16:09:13,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:13,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:13,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:13,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,421 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 3 states. [2018-12-30 16:09:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:13,644 INFO L93 Difference]: Finished difference Result 3871 states and 5290 transitions. [2018-12-30 16:09:13,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:13,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2018-12-30 16:09:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:13,649 INFO L225 Difference]: With dead ends: 3871 [2018-12-30 16:09:13,649 INFO L226 Difference]: Without dead ends: 1975 [2018-12-30 16:09:13,652 INFO L631 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 [2018-12-30 16:09:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-12-30 16:09:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1935. [2018-12-30 16:09:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2018-12-30 16:09:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2633 transitions. [2018-12-30 16:09:13,714 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2633 transitions. Word has length 1028 [2018-12-30 16:09:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:13,714 INFO L480 AbstractCegarLoop]: Abstraction has 1935 states and 2633 transitions. [2018-12-30 16:09:13,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2633 transitions. [2018-12-30 16:09:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2018-12-30 16:09:13,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:13,728 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 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, 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] [2018-12-30 16:09:13,728 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1152424720, now seen corresponding path program 1 times [2018-12-30 16:09:13,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:13,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:13,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:13,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2018-12-30 16:09:14,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:14,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:14,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:14,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:14,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,316 INFO L87 Difference]: Start difference. First operand 1935 states and 2633 transitions. Second operand 3 states. [2018-12-30 16:09:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:14,683 INFO L93 Difference]: Finished difference Result 3831 states and 5212 transitions. [2018-12-30 16:09:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:14,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1043 [2018-12-30 16:09:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:14,687 INFO L225 Difference]: With dead ends: 3831 [2018-12-30 16:09:14,687 INFO L226 Difference]: Without dead ends: 1935 [2018-12-30 16:09:14,690 INFO L631 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 [2018-12-30 16:09:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-12-30 16:09:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2018-12-30 16:09:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2018-12-30 16:09:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2595 transitions. [2018-12-30 16:09:14,771 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2595 transitions. Word has length 1043 [2018-12-30 16:09:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:14,771 INFO L480 AbstractCegarLoop]: Abstraction has 1935 states and 2595 transitions. [2018-12-30 16:09:14,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2595 transitions. [2018-12-30 16:09:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-12-30 16:09:14,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:14,787 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:14,787 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:14,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:14,788 INFO L82 PathProgramCache]: Analyzing trace with hash -529516007, now seen corresponding path program 1 times [2018-12-30 16:09:14,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:14,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:14,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:14,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2018-12-30 16:09:15,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:15,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:15,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,668 INFO L87 Difference]: Start difference. First operand 1935 states and 2595 transitions. Second operand 3 states. [2018-12-30 16:09:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:15,849 INFO L93 Difference]: Finished difference Result 3871 states and 5194 transitions. [2018-12-30 16:09:15,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:15,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2018-12-30 16:09:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:15,852 INFO L225 Difference]: With dead ends: 3871 [2018-12-30 16:09:15,852 INFO L226 Difference]: Without dead ends: 1963 [2018-12-30 16:09:15,854 INFO L631 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 [2018-12-30 16:09:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2018-12-30 16:09:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2018-12-30 16:09:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2018-12-30 16:09:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2623 transitions. [2018-12-30 16:09:15,915 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2623 transitions. Word has length 1071 [2018-12-30 16:09:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:15,915 INFO L480 AbstractCegarLoop]: Abstraction has 1963 states and 2623 transitions. [2018-12-30 16:09:15,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2623 transitions. [2018-12-30 16:09:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-12-30 16:09:15,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:15,931 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 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, 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] [2018-12-30 16:09:15,931 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash -503398519, now seen corresponding path program 1 times [2018-12-30 16:09:15,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:15,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:15,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2018-12-30 16:09:16,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:16,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:16,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:16,473 INFO L87 Difference]: Start difference. First operand 1963 states and 2623 transitions. Second operand 3 states. [2018-12-30 16:09:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:16,645 INFO L93 Difference]: Finished difference Result 2491 states and 3323 transitions. [2018-12-30 16:09:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:16,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2018-12-30 16:09:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:16,647 INFO L225 Difference]: With dead ends: 2491 [2018-12-30 16:09:16,647 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:09:16,649 INFO L631 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 [2018-12-30 16:09:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:09:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:09:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:09:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:09:16,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1103 [2018-12-30 16:09:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:16,650 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:09:16,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:09:16,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:09:16,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:09:16,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:16,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:16,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:16,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:16,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:16,930 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 131 [2018-12-30 16:09:17,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,529 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 133 [2018-12-30 16:09:17,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:17,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:18,408 WARN L181 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-12-30 16:09:19,760 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 120 DAG size of output: 84 [2018-12-30 16:09:22,234 WARN L181 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-12-30 16:09:22,667 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2018-12-30 16:09:23,111 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2018-12-30 16:09:23,460 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2018-12-30 16:09:23,845 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-12-30 16:09:24,123 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-12-30 16:09:24,447 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2018-12-30 16:09:24,885 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2018-12-30 16:09:25,363 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2018-12-30 16:09:25,913 WARN L181 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-12-30 16:09:26,320 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2018-12-30 16:09:26,694 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2018-12-30 16:09:27,044 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2018-12-30 16:09:27,590 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-12-30 16:09:28,459 WARN L181 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2018-12-30 16:09:28,799 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2018-12-30 16:09:29,774 WARN L181 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2018-12-30 16:09:30,373 WARN L181 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-12-30 16:09:30,774 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2018-12-30 16:09:30,778 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-12-30 16:09:30,779 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 551) no Hoare annotation was computed. [2018-12-30 16:09:30,779 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 562) no Hoare annotation was computed. [2018-12-30 16:09:30,779 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 573) no Hoare annotation was computed. [2018-12-30 16:09:30,779 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 584) no Hoare annotation was computed. [2018-12-30 16:09:30,779 INFO L451 ceAbstractionStarter]: At program point L631(lines 622 633) the Hoare annotation is: true [2018-12-30 16:09:30,779 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-12-30 16:09:30,779 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 238) no Hoare annotation was computed. [2018-12-30 16:09:30,780 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 552) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2018-12-30 16:09:30,780 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 584) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) [2018-12-30 16:09:30,780 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 309) no Hoare annotation was computed. [2018-12-30 16:09:30,781 INFO L448 ceAbstractionStarter]: For program point L302-2(lines 302 309) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 550) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 561) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 572) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 583) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L448 ceAbstractionStarter]: For program point L535(lines 535 541) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 535 541) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 361) no Hoare annotation was computed. [2018-12-30 16:09:30,784 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 550) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:09:30,785 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 562) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,785 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 573) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse12 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse13)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) .cse12))) [2018-12-30 16:09:30,785 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 274) no Hoare annotation was computed. [2018-12-30 16:09:30,785 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 208 547) no Hoare annotation was computed. [2018-12-30 16:09:30,785 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2018-12-30 16:09:30,785 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 550) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 560) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 571) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 582) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L451 ceAbstractionStarter]: At program point L604(lines 98 605) the Hoare annotation is: true [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 540) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 509) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-12-30 16:09:30,786 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 559) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 570) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 581) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L448 ceAbstractionStarter]: For program point L475-2(lines 208 547) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-12-30 16:09:30,787 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 583) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,789 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 560) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse17 .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,789 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,789 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2018-12-30 16:09:30,789 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 611) no Hoare annotation was computed. [2018-12-30 16:09:30,789 INFO L448 ceAbstractionStarter]: For program point L609-2(lines 609 611) no Hoare annotation was computed. [2018-12-30 16:09:30,789 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 558) no Hoare annotation was computed. [2018-12-30 16:09:30,789 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 569) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 580) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L451 ceAbstractionStarter]: At program point L612(lines 12 616) the Hoare annotation is: true [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 557) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 568) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 579) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 520) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2018-12-30 16:09:30,790 INFO L448 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2018-12-30 16:09:30,791 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2018-12-30 16:09:30,791 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 558) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2018-12-30 16:09:30,791 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 569) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,791 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2018-12-30 16:09:30,792 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:09:30,792 INFO L444 ceAbstractionStarter]: At program point L548(lines 99 603) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse14 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11 .cse12) (and (and .cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2018-12-30 16:09:30,792 INFO L444 ceAbstractionStarter]: At program point L350(lines 325 368) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:09:30,792 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 549) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L444 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 287) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 208 547) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 556) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 549) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 567) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 578) no Hoare annotation was computed. [2018-12-30 16:09:30,793 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 519) no Hoare annotation was computed. [2018-12-30 16:09:30,797 INFO L444 ceAbstractionStarter]: At program point L517-1(lines 208 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2018-12-30 16:09:30,797 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2018-12-30 16:09:30,797 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 323) no Hoare annotation was computed. [2018-12-30 16:09:30,797 INFO L448 ceAbstractionStarter]: For program point L319-2(lines 208 547) no Hoare annotation was computed. [2018-12-30 16:09:30,797 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 579) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:09:30,797 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-30 16:09:30,797 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 601) no Hoare annotation was computed. [2018-12-30 16:09:30,797 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 555) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 566) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 577) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 73 615) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 600) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:09:30,798 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 556) the Hoare annotation is: (let ((.cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse3 .cse2 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2018-12-30 16:09:30,806 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 567) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,806 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 577) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) [2018-12-30 16:09:30,806 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-30 16:09:30,806 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 592) no Hoare annotation was computed. [2018-12-30 16:09:30,806 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 586 600) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 295) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 291 295) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 554) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 565) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 576) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 591) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 233) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 226 233) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:09:30,807 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2018-12-30 16:09:30,808 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 495) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L525-2(lines 525 529) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 434) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L426-2(lines 426 434) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 553) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 564) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 575) no Hoare annotation was computed. [2018-12-30 16:09:30,810 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 367) no Hoare annotation was computed. [2018-12-30 16:09:30,811 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 554) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse17 .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2018-12-30 16:09:30,811 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 565) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:09:30,811 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 598) no Hoare annotation was computed. [2018-12-30 16:09:30,811 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2018-12-30 16:09:30,811 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:30,811 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 552) no Hoare annotation was computed. [2018-12-30 16:09:30,812 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 563) no Hoare annotation was computed. [2018-12-30 16:09:30,812 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 574) no Hoare annotation was computed. [2018-12-30 16:09:30,815 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 603) the Hoare annotation is: (let ((.cse17 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse18 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse18 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse15 .cse16) (and (and .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2018-12-30 16:09:30,815 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 366) no Hoare annotation was computed. [2018-12-30 16:09:30,815 INFO L448 ceAbstractionStarter]: For program point L331-1(lines 331 366) no Hoare annotation was computed. [2018-12-30 16:09:30,815 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 563) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:09:30,816 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 576) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15))) [2018-12-30 16:09:30,816 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:09:30,816 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-12-30 16:09:30,816 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 208 547) no Hoare annotation was computed. [2018-12-30 16:09:30,816 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 363) no Hoare annotation was computed. [2018-12-30 16:09:30,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:09:30 BoogieIcfgContainer [2018-12-30 16:09:30,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:09:30,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:09:30,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:09:30,916 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:09:30,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:08:48" (3/4) ... [2018-12-30 16:09:30,920 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:09:30,954 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:09:30,955 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:09:31,131 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:09:31,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:09:31,133 INFO L168 Benchmark]: Toolchain (without parser) took 44561.90 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 952.7 MB in the beginning and 1.9 GB in the end (delta: -953.7 MB). Peak memory consumption was 569.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:31,134 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:09:31,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:31,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:31,135 INFO L168 Benchmark]: Boogie Preprocessor took 57.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:31,136 INFO L168 Benchmark]: RCFGBuilder took 1257.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:31,136 INFO L168 Benchmark]: TraceAbstraction took 42405.94 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -865.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-30 16:09:31,136 INFO L168 Benchmark]: Witness Printer took 215.11 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:31,141 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 479.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1257.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42405.94 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -865.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 215.11 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: 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: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8497 == s__state) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (((((((!(8609 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (((((((((((!(8497 == s__state) && 8448 <= s__state) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576)) || (blastFlag <= 3 && !(s__hit == 0))) || s__state <= 3) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((8448 <= s__state && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8576 == s__state)) && s__s3__tmp__next_state___0 <= 3) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8609 == s__state) && !(8497 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(8609 == s__state) && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (8448 <= s__state && ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((!(8448 == s__state) && blastFlag == 2) && s__state <= 8448) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(8609 == s__state) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576)) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8497 == s__state) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (((((((!(8609 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (((((((((((!(8497 == s__state) && 8448 <= s__state) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (blastFlag <= 3 && !(s__hit == 0))) || s__state <= 3) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. SAFE Result, 42.2s OverallTime, 38 OverallIterations, 38 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 14.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 6343 SDtfs, 5182 SDslu, 2550 SDs, 0 SdLazy, 3595 SolverSat, 1368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1146 GetRequests, 1099 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3059occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 1700 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 222 NumberOfFragments, 4018 HoareAnnotationTreeSize, 28 FomulaSimplifications, 34754 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 6460 FormulaSimplificationTreeSizeReductionInter, 13.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 11132 NumberOfCodeBlocks, 11132 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 11092 ConstructedInterpolants, 0 QuantifiedInterpolants, 8032549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1606 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 40 InterpolantComputations, 38 PerfectInterpolantSequences, 72841/72893 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...