./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_6_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 30944670c48cc2995b7d28a1cfa4117c8585a6fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:23:44,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:23:44,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:23:44,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:23:44,544 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:23:44,545 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:23:44,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:23:44,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:23:44,550 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:23:44,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:23:44,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:23:44,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:23:44,553 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:23:44,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:23:44,556 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:23:44,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:23:44,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:23:44,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:23:44,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:23:44,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:23:44,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:23:44,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:23:44,570 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:23:44,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:23:44,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:23:44,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:23:44,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:23:44,573 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:23:44,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:23:44,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:23:44,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:23:44,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:23:44,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:23:44,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:23:44,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:23:44,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:23:44,579 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:23:44,595 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:23:44,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:23:44,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:23:44,597 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:23:44,597 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:23:44,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:23:44,598 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:23:44,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:23:44,598 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:23:44,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:23:44,598 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:23:44,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:23:44,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:23:44,600 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:23:44,600 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:23:44,600 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:23:44,600 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:23:44,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:23:44,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:23:44,602 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:23:44,602 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:23:44,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:44,602 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:23:44,602 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:23:44,603 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:23:44,603 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:23:44,603 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:23:44,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:23:44,603 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 -> 30944670c48cc2995b7d28a1cfa4117c8585a6fe [2019-01-11 21:23:44,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:23:44,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:23:44,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:23:44,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:23:44,668 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:23:44,669 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:44,732 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b00b9e7/988046c615364d258a7920033309c677/FLAGb93b35eef [2019-01-11 21:23:45,187 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:23:45,190 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:45,207 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b00b9e7/988046c615364d258a7920033309c677/FLAGb93b35eef [2019-01-11 21:23:45,527 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b00b9e7/988046c615364d258a7920033309c677 [2019-01-11 21:23:45,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:23:45,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:23:45,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:45,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:23:45,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:23:45,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:45" (1/1) ... [2019-01-11 21:23:45,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bed4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:45, skipping insertion in model container [2019-01-11 21:23:45,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:45" (1/1) ... [2019-01-11 21:23:45,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:23:45,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:23:45,957 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:45,963 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:23:46,074 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:46,093 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:23:46,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46 WrapperNode [2019-01-11 21:23:46,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:46,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:46,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:23:46,095 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:23:46,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:46,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:23:46,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:23:46,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:23:46,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... [2019-01-11 21:23:46,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:23:46,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:23:46,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:23:46,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:23:46,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:23:46,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:23:46,532 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:23:47,764 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:23:47,764 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:23:47,766 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:23:47,766 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:23:47,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:47 BoogieIcfgContainer [2019-01-11 21:23:47,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:23:47,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:23:47,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:23:47,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:23:47,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:23:45" (1/3) ... [2019-01-11 21:23:47,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8c1c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:47, skipping insertion in model container [2019-01-11 21:23:47,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:46" (2/3) ... [2019-01-11 21:23:47,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8c1c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:47, skipping insertion in model container [2019-01-11 21:23:47,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:47" (3/3) ... [2019-01-11 21:23:47,777 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_6_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:47,787 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:23:47,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:23:47,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:23:47,839 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:23:47,840 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:23:47,840 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:23:47,840 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:23:47,840 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:23:47,841 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:23:47,841 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:23:47,841 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:23:47,841 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:23:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-01-11 21:23:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:23:47,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:47,873 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] [2019-01-11 21:23:47,875 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610309, now seen corresponding path program 1 times [2019-01-11 21:23:47,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:47,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:48,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:48,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:48,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:48,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:48,166 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 3 states. [2019-01-11 21:23:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:49,039 INFO L93 Difference]: Finished difference Result 362 states and 633 transitions. [2019-01-11 21:23:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:49,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:23:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:49,055 INFO L225 Difference]: With dead ends: 362 [2019-01-11 21:23:49,055 INFO L226 Difference]: Without dead ends: 192 [2019-01-11 21:23:49,059 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 [2019-01-11 21:23:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-11 21:23:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2019-01-11 21:23:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-11 21:23:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 300 transitions. [2019-01-11 21:23:49,111 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 300 transitions. Word has length 43 [2019-01-11 21:23:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:49,112 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 300 transitions. [2019-01-11 21:23:49,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 300 transitions. [2019-01-11 21:23:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:23:49,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:49,115 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] [2019-01-11 21:23:49,116 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash -918181364, now seen corresponding path program 1 times [2019-01-11 21:23:49,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:49,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:49,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:49,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:49,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:49,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:49,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,233 INFO L87 Difference]: Start difference. First operand 182 states and 300 transitions. Second operand 3 states. [2019-01-11 21:23:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:49,665 INFO L93 Difference]: Finished difference Result 406 states and 678 transitions. [2019-01-11 21:23:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:49,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:23:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:49,669 INFO L225 Difference]: With dead ends: 406 [2019-01-11 21:23:49,669 INFO L226 Difference]: Without dead ends: 231 [2019-01-11 21:23:49,671 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 [2019-01-11 21:23:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-11 21:23:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2019-01-11 21:23:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 21:23:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 373 transitions. [2019-01-11 21:23:49,696 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 373 transitions. Word has length 44 [2019-01-11 21:23:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:49,696 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 373 transitions. [2019-01-11 21:23:49,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 373 transitions. [2019-01-11 21:23:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 21:23:49,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:49,701 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] [2019-01-11 21:23:49,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1182821184, now seen corresponding path program 1 times [2019-01-11 21:23:49,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:49,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:49,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:49,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:49,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,804 INFO L87 Difference]: Start difference. First operand 221 states and 373 transitions. Second operand 3 states. [2019-01-11 21:23:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:50,134 INFO L93 Difference]: Finished difference Result 466 states and 793 transitions. [2019-01-11 21:23:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:50,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-11 21:23:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:50,138 INFO L225 Difference]: With dead ends: 466 [2019-01-11 21:23:50,138 INFO L226 Difference]: Without dead ends: 252 [2019-01-11 21:23:50,140 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 [2019-01-11 21:23:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-11 21:23:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-01-11 21:23:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-11 21:23:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 429 transitions. [2019-01-11 21:23:50,162 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 429 transitions. Word has length 71 [2019-01-11 21:23:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:50,163 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 429 transitions. [2019-01-11 21:23:50,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 429 transitions. [2019-01-11 21:23:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-11 21:23:50,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:50,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:50,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2081183082, now seen corresponding path program 1 times [2019-01-11 21:23:50,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:50,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:50,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:50,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:50,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:50,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:50,284 INFO L87 Difference]: Start difference. First operand 252 states and 429 transitions. Second operand 3 states. [2019-01-11 21:23:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:50,717 INFO L93 Difference]: Finished difference Result 536 states and 918 transitions. [2019-01-11 21:23:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:50,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-11 21:23:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:50,722 INFO L225 Difference]: With dead ends: 536 [2019-01-11 21:23:50,722 INFO L226 Difference]: Without dead ends: 291 [2019-01-11 21:23:50,723 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 [2019-01-11 21:23:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-01-11 21:23:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2019-01-11 21:23:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-11 21:23:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 494 transitions. [2019-01-11 21:23:50,737 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 494 transitions. Word has length 77 [2019-01-11 21:23:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:50,737 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 494 transitions. [2019-01-11 21:23:50,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 494 transitions. [2019-01-11 21:23:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 21:23:50,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:50,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:50,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2046128707, now seen corresponding path program 1 times [2019-01-11 21:23:50,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:50,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:50,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:50,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:50,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:50,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:50,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:50,851 INFO L87 Difference]: Start difference. First operand 288 states and 494 transitions. Second operand 3 states. [2019-01-11 21:23:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:51,380 INFO L93 Difference]: Finished difference Result 572 states and 981 transitions. [2019-01-11 21:23:51,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:51,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-01-11 21:23:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:51,384 INFO L225 Difference]: With dead ends: 572 [2019-01-11 21:23:51,384 INFO L226 Difference]: Without dead ends: 291 [2019-01-11 21:23:51,385 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 [2019-01-11 21:23:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-01-11 21:23:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2019-01-11 21:23:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-11 21:23:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 492 transitions. [2019-01-11 21:23:51,398 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 492 transitions. Word has length 78 [2019-01-11 21:23:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:51,399 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 492 transitions. [2019-01-11 21:23:51,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 492 transitions. [2019-01-11 21:23:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:23:51,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:51,402 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] [2019-01-11 21:23:51,403 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1823459990, now seen corresponding path program 1 times [2019-01-11 21:23:51,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:51,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:51,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:51,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:51,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:51,530 INFO L87 Difference]: Start difference. First operand 288 states and 492 transitions. Second operand 3 states. [2019-01-11 21:23:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:51,807 INFO L93 Difference]: Finished difference Result 586 states and 1001 transitions. [2019-01-11 21:23:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:51,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:23:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:51,811 INFO L225 Difference]: With dead ends: 586 [2019-01-11 21:23:51,811 INFO L226 Difference]: Without dead ends: 305 [2019-01-11 21:23:51,812 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 [2019-01-11 21:23:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-11 21:23:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2019-01-11 21:23:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-01-11 21:23:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 514 transitions. [2019-01-11 21:23:51,822 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 514 transitions. Word has length 83 [2019-01-11 21:23:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:51,823 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 514 transitions. [2019-01-11 21:23:51,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 514 transitions. [2019-01-11 21:23:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:23:51,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:51,825 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] [2019-01-11 21:23:51,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1102198878, now seen corresponding path program 1 times [2019-01-11 21:23:51,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:51,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:51,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:51,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:51,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:51,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:51,912 INFO L87 Difference]: Start difference. First operand 303 states and 514 transitions. Second operand 3 states. [2019-01-11 21:23:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:52,722 INFO L93 Difference]: Finished difference Result 601 states and 1019 transitions. [2019-01-11 21:23:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:52,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:52,728 INFO L225 Difference]: With dead ends: 601 [2019-01-11 21:23:52,732 INFO L226 Difference]: Without dead ends: 305 [2019-01-11 21:23:52,733 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 [2019-01-11 21:23:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-11 21:23:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2019-01-11 21:23:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-01-11 21:23:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 510 transitions. [2019-01-11 21:23:52,754 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 510 transitions. Word has length 84 [2019-01-11 21:23:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:52,754 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 510 transitions. [2019-01-11 21:23:52,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 510 transitions. [2019-01-11 21:23:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:23:52,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:52,756 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] [2019-01-11 21:23:52,757 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2038845885, now seen corresponding path program 1 times [2019-01-11 21:23:52,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:52,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:52,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:52,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:52,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:23:52,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:52,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:52,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:52,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:52,874 INFO L87 Difference]: Start difference. First operand 303 states and 510 transitions. Second operand 3 states. [2019-01-11 21:23:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:53,280 INFO L93 Difference]: Finished difference Result 608 states and 1021 transitions. [2019-01-11 21:23:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:53,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:23:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:53,283 INFO L225 Difference]: With dead ends: 608 [2019-01-11 21:23:53,283 INFO L226 Difference]: Without dead ends: 312 [2019-01-11 21:23:53,284 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 [2019-01-11 21:23:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-11 21:23:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-01-11 21:23:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-11 21:23:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 516 transitions. [2019-01-11 21:23:53,295 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 516 transitions. Word has length 96 [2019-01-11 21:23:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:53,295 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 516 transitions. [2019-01-11 21:23:53,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 516 transitions. [2019-01-11 21:23:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 21:23:53,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:53,297 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] [2019-01-11 21:23:53,297 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:53,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2067402745, now seen corresponding path program 1 times [2019-01-11 21:23:53,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:53,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:53,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:53,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:53,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:53,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:53,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:53,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:53,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:53,393 INFO L87 Difference]: Start difference. First operand 312 states and 516 transitions. Second operand 3 states. [2019-01-11 21:23:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:53,778 INFO L93 Difference]: Finished difference Result 648 states and 1074 transitions. [2019-01-11 21:23:53,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:53,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-11 21:23:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:53,783 INFO L225 Difference]: With dead ends: 648 [2019-01-11 21:23:53,783 INFO L226 Difference]: Without dead ends: 343 [2019-01-11 21:23:53,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 [2019-01-11 21:23:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-11 21:23:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2019-01-11 21:23:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 21:23:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 563 transitions. [2019-01-11 21:23:53,796 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 563 transitions. Word has length 97 [2019-01-11 21:23:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:53,797 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 563 transitions. [2019-01-11 21:23:53,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 563 transitions. [2019-01-11 21:23:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:23:53,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:53,799 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] [2019-01-11 21:23:53,799 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash -405291931, now seen corresponding path program 1 times [2019-01-11 21:23:53,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:53,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:53,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:53,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:53,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:53,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:53,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:53,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:53,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:53,869 INFO L87 Difference]: Start difference. First operand 341 states and 563 transitions. Second operand 3 states. [2019-01-11 21:23:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:54,603 INFO L93 Difference]: Finished difference Result 677 states and 1117 transitions. [2019-01-11 21:23:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:54,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:23:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:54,608 INFO L225 Difference]: With dead ends: 677 [2019-01-11 21:23:54,608 INFO L226 Difference]: Without dead ends: 343 [2019-01-11 21:23:54,608 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 [2019-01-11 21:23:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-11 21:23:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2019-01-11 21:23:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 21:23:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 559 transitions. [2019-01-11 21:23:54,621 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 559 transitions. Word has length 98 [2019-01-11 21:23:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:54,628 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 559 transitions. [2019-01-11 21:23:54,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 559 transitions. [2019-01-11 21:23:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 21:23:54,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:54,629 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] [2019-01-11 21:23:54,632 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1888540852, now seen corresponding path program 1 times [2019-01-11 21:23:54,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:54,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:54,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:54,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:54,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:54,730 INFO L87 Difference]: Start difference. First operand 341 states and 559 transitions. Second operand 3 states. [2019-01-11 21:23:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:55,375 INFO L93 Difference]: Finished difference Result 711 states and 1169 transitions. [2019-01-11 21:23:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:55,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-11 21:23:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:55,377 INFO L225 Difference]: With dead ends: 711 [2019-01-11 21:23:55,377 INFO L226 Difference]: Without dead ends: 377 [2019-01-11 21:23:55,378 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 [2019-01-11 21:23:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-11 21:23:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2019-01-11 21:23:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-01-11 21:23:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 601 transitions. [2019-01-11 21:23:55,393 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 601 transitions. Word has length 100 [2019-01-11 21:23:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:55,393 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 601 transitions. [2019-01-11 21:23:55,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 601 transitions. [2019-01-11 21:23:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-11 21:23:55,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:55,395 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] [2019-01-11 21:23:55,395 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash -914923520, now seen corresponding path program 1 times [2019-01-11 21:23:55,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:55,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:55,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:55,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:55,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:55,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:55,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:55,493 INFO L87 Difference]: Start difference. First operand 368 states and 601 transitions. Second operand 3 states. [2019-01-11 21:23:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:55,682 INFO L93 Difference]: Finished difference Result 738 states and 1206 transitions. [2019-01-11 21:23:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:55,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-11 21:23:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:55,686 INFO L225 Difference]: With dead ends: 738 [2019-01-11 21:23:55,686 INFO L226 Difference]: Without dead ends: 377 [2019-01-11 21:23:55,688 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 [2019-01-11 21:23:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-11 21:23:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2019-01-11 21:23:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-01-11 21:23:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 596 transitions. [2019-01-11 21:23:55,701 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 596 transitions. Word has length 101 [2019-01-11 21:23:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:55,701 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 596 transitions. [2019-01-11 21:23:55,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 596 transitions. [2019-01-11 21:23:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-11 21:23:55,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:55,703 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:55,704 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1027811327, now seen corresponding path program 1 times [2019-01-11 21:23:55,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:55,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:55,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-11 21:23:55,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:55,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:55,791 INFO L87 Difference]: Start difference. First operand 368 states and 596 transitions. Second operand 3 states. [2019-01-11 21:23:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:56,521 INFO L93 Difference]: Finished difference Result 766 states and 1241 transitions. [2019-01-11 21:23:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:56,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-11 21:23:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:56,526 INFO L225 Difference]: With dead ends: 766 [2019-01-11 21:23:56,526 INFO L226 Difference]: Without dead ends: 405 [2019-01-11 21:23:56,527 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 [2019-01-11 21:23:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-11 21:23:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-01-11 21:23:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-11 21:23:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 649 transitions. [2019-01-11 21:23:56,546 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 649 transitions. Word has length 109 [2019-01-11 21:23:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:56,546 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 649 transitions. [2019-01-11 21:23:56,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 649 transitions. [2019-01-11 21:23:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 21:23:56,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:56,550 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:56,550 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1871752250, now seen corresponding path program 1 times [2019-01-11 21:23:56,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:56,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:56,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-11 21:23:56,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:56,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:56,693 INFO L87 Difference]: Start difference. First operand 402 states and 649 transitions. Second operand 3 states. [2019-01-11 21:23:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:57,203 INFO L93 Difference]: Finished difference Result 800 states and 1291 transitions. [2019-01-11 21:23:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:57,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-01-11 21:23:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:57,209 INFO L225 Difference]: With dead ends: 800 [2019-01-11 21:23:57,209 INFO L226 Difference]: Without dead ends: 405 [2019-01-11 21:23:57,210 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 [2019-01-11 21:23:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-11 21:23:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-01-11 21:23:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-11 21:23:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 646 transitions. [2019-01-11 21:23:57,222 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 646 transitions. Word has length 110 [2019-01-11 21:23:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:57,222 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 646 transitions. [2019-01-11 21:23:57,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 646 transitions. [2019-01-11 21:23:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-11 21:23:57,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:57,224 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:57,224 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -999335216, now seen corresponding path program 1 times [2019-01-11 21:23:57,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:57,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:57,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:57,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:57,307 INFO L87 Difference]: Start difference. First operand 402 states and 646 transitions. Second operand 3 states. [2019-01-11 21:23:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:57,526 INFO L93 Difference]: Finished difference Result 845 states and 1357 transitions. [2019-01-11 21:23:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:57,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-01-11 21:23:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:57,530 INFO L225 Difference]: With dead ends: 845 [2019-01-11 21:23:57,530 INFO L226 Difference]: Without dead ends: 450 [2019-01-11 21:23:57,531 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 [2019-01-11 21:23:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-01-11 21:23:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 444. [2019-01-11 21:23:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-01-11 21:23:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 711 transitions. [2019-01-11 21:23:57,544 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 711 transitions. Word has length 113 [2019-01-11 21:23:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:57,545 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 711 transitions. [2019-01-11 21:23:57,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 711 transitions. [2019-01-11 21:23:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-11 21:23:57,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:57,549 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:57,549 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash 948766871, now seen corresponding path program 1 times [2019-01-11 21:23:57,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:57,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:57,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:57,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:57,660 INFO L87 Difference]: Start difference. First operand 444 states and 711 transitions. Second operand 3 states. [2019-01-11 21:23:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:58,510 INFO L93 Difference]: Finished difference Result 891 states and 1428 transitions. [2019-01-11 21:23:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:58,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-01-11 21:23:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:58,514 INFO L225 Difference]: With dead ends: 891 [2019-01-11 21:23:58,514 INFO L226 Difference]: Without dead ends: 452 [2019-01-11 21:23:58,515 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 [2019-01-11 21:23:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-01-11 21:23:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 446. [2019-01-11 21:23:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-11 21:23:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 714 transitions. [2019-01-11 21:23:58,530 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 714 transitions. Word has length 114 [2019-01-11 21:23:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:58,530 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 714 transitions. [2019-01-11 21:23:58,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 714 transitions. [2019-01-11 21:23:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-11 21:23:58,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:58,535 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:58,535 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1289805000, now seen corresponding path program 1 times [2019-01-11 21:23:58,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:58,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-11 21:23:58,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:58,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:58,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:58,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:58,635 INFO L87 Difference]: Start difference. First operand 446 states and 714 transitions. Second operand 3 states. [2019-01-11 21:23:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:59,170 INFO L93 Difference]: Finished difference Result 924 states and 1483 transitions. [2019-01-11 21:23:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:59,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-01-11 21:23:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:59,175 INFO L225 Difference]: With dead ends: 924 [2019-01-11 21:23:59,175 INFO L226 Difference]: Without dead ends: 485 [2019-01-11 21:23:59,176 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 [2019-01-11 21:23:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-01-11 21:23:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 471. [2019-01-11 21:23:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-01-11 21:23:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 749 transitions. [2019-01-11 21:23:59,191 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 749 transitions. Word has length 126 [2019-01-11 21:23:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:59,191 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 749 transitions. [2019-01-11 21:23:59,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 749 transitions. [2019-01-11 21:23:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-11 21:23:59,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:59,194 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:59,194 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1057341556, now seen corresponding path program 1 times [2019-01-11 21:23:59,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:59,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:59,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:59,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-11 21:23:59,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:59,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:59,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:59,276 INFO L87 Difference]: Start difference. First operand 471 states and 749 transitions. Second operand 3 states. [2019-01-11 21:23:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:59,466 INFO L93 Difference]: Finished difference Result 949 states and 1510 transitions. [2019-01-11 21:23:59,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:59,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-01-11 21:23:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:59,471 INFO L225 Difference]: With dead ends: 949 [2019-01-11 21:23:59,471 INFO L226 Difference]: Without dead ends: 485 [2019-01-11 21:23:59,472 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 [2019-01-11 21:23:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-01-11 21:23:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 471. [2019-01-11 21:23:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-01-11 21:23:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 741 transitions. [2019-01-11 21:23:59,487 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 741 transitions. Word has length 127 [2019-01-11 21:23:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:59,488 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 741 transitions. [2019-01-11 21:23:59,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 741 transitions. [2019-01-11 21:23:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-11 21:23:59,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:59,491 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, 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] [2019-01-11 21:23:59,491 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1852729836, now seen corresponding path program 1 times [2019-01-11 21:23:59,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:59,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-01-11 21:23:59,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:59,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:59,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:59,561 INFO L87 Difference]: Start difference. First operand 471 states and 741 transitions. Second operand 3 states. [2019-01-11 21:24:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:00,430 INFO L93 Difference]: Finished difference Result 941 states and 1480 transitions. [2019-01-11 21:24:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:00,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-01-11 21:24:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:00,434 INFO L225 Difference]: With dead ends: 941 [2019-01-11 21:24:00,434 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 21:24:00,435 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 [2019-01-11 21:24:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 21:24:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 471. [2019-01-11 21:24:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-01-11 21:24:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 736 transitions. [2019-01-11 21:24:00,449 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 736 transitions. Word has length 142 [2019-01-11 21:24:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:00,450 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 736 transitions. [2019-01-11 21:24:00,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 736 transitions. [2019-01-11 21:24:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-01-11 21:24:00,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:00,452 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, 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] [2019-01-11 21:24:00,454 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash -591047027, now seen corresponding path program 1 times [2019-01-11 21:24:00,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:00,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:00,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-01-11 21:24:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:00,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:00,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:00,539 INFO L87 Difference]: Start difference. First operand 471 states and 736 transitions. Second operand 3 states. [2019-01-11 21:24:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:00,818 INFO L93 Difference]: Finished difference Result 941 states and 1470 transitions. [2019-01-11 21:24:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:00,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-01-11 21:24:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:00,823 INFO L225 Difference]: With dead ends: 941 [2019-01-11 21:24:00,823 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 21:24:00,824 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 [2019-01-11 21:24:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 21:24:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 471. [2019-01-11 21:24:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-01-11 21:24:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 731 transitions. [2019-01-11 21:24:00,843 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 731 transitions. Word has length 143 [2019-01-11 21:24:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:00,843 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 731 transitions. [2019-01-11 21:24:00,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 731 transitions. [2019-01-11 21:24:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-11 21:24:00,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:00,847 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:00,847 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -496968781, now seen corresponding path program 1 times [2019-01-11 21:24:00,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:00,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-11 21:24:00,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:00,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:00,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:00,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:00,956 INFO L87 Difference]: Start difference. First operand 471 states and 731 transitions. Second operand 3 states. [2019-01-11 21:24:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:01,133 INFO L93 Difference]: Finished difference Result 964 states and 1498 transitions. [2019-01-11 21:24:01,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:01,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-01-11 21:24:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:01,137 INFO L225 Difference]: With dead ends: 964 [2019-01-11 21:24:01,138 INFO L226 Difference]: Without dead ends: 500 [2019-01-11 21:24:01,139 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 [2019-01-11 21:24:01,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-01-11 21:24:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 495. [2019-01-11 21:24:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-01-11 21:24:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 762 transitions. [2019-01-11 21:24:01,154 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 762 transitions. Word has length 147 [2019-01-11 21:24:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:01,155 INFO L480 AbstractCegarLoop]: Abstraction has 495 states and 762 transitions. [2019-01-11 21:24:01,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 762 transitions. [2019-01-11 21:24:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-11 21:24:01,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:01,157 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:01,159 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1996412097, now seen corresponding path program 1 times [2019-01-11 21:24:01,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:01,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:01,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:01,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-11 21:24:01,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:01,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:01,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:01,244 INFO L87 Difference]: Start difference. First operand 495 states and 762 transitions. Second operand 3 states. [2019-01-11 21:24:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:01,726 INFO L93 Difference]: Finished difference Result 988 states and 1520 transitions. [2019-01-11 21:24:01,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:01,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-01-11 21:24:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:01,732 INFO L225 Difference]: With dead ends: 988 [2019-01-11 21:24:01,732 INFO L226 Difference]: Without dead ends: 500 [2019-01-11 21:24:01,733 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 [2019-01-11 21:24:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-01-11 21:24:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 495. [2019-01-11 21:24:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-01-11 21:24:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 753 transitions. [2019-01-11 21:24:01,748 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 753 transitions. Word has length 148 [2019-01-11 21:24:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:01,748 INFO L480 AbstractCegarLoop]: Abstraction has 495 states and 753 transitions. [2019-01-11 21:24:01,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 753 transitions. [2019-01-11 21:24:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-11 21:24:01,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:01,752 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:01,752 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash 94488236, now seen corresponding path program 1 times [2019-01-11 21:24:01,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:01,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:01,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-01-11 21:24:01,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:01,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:01,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:01,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:01,835 INFO L87 Difference]: Start difference. First operand 495 states and 753 transitions. Second operand 3 states. [2019-01-11 21:24:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:02,179 INFO L93 Difference]: Finished difference Result 1031 states and 1563 transitions. [2019-01-11 21:24:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:02,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-01-11 21:24:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:02,183 INFO L225 Difference]: With dead ends: 1031 [2019-01-11 21:24:02,183 INFO L226 Difference]: Without dead ends: 543 [2019-01-11 21:24:02,184 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 [2019-01-11 21:24:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-11 21:24:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 536. [2019-01-11 21:24:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-01-11 21:24:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 808 transitions. [2019-01-11 21:24:02,200 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 808 transitions. Word has length 153 [2019-01-11 21:24:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:02,202 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 808 transitions. [2019-01-11 21:24:02,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 808 transitions. [2019-01-11 21:24:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-11 21:24:02,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:02,205 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:02,205 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:02,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1668084205, now seen corresponding path program 1 times [2019-01-11 21:24:02,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:02,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-01-11 21:24:02,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:02,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:02,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:02,299 INFO L87 Difference]: Start difference. First operand 536 states and 808 transitions. Second operand 3 states. [2019-01-11 21:24:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:03,087 INFO L93 Difference]: Finished difference Result 1072 states and 1616 transitions. [2019-01-11 21:24:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:03,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-01-11 21:24:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:03,091 INFO L225 Difference]: With dead ends: 1072 [2019-01-11 21:24:03,091 INFO L226 Difference]: Without dead ends: 524 [2019-01-11 21:24:03,092 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 [2019-01-11 21:24:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-11 21:24:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 517. [2019-01-11 21:24:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-01-11 21:24:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 778 transitions. [2019-01-11 21:24:03,108 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 778 transitions. Word has length 154 [2019-01-11 21:24:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:03,109 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 778 transitions. [2019-01-11 21:24:03,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 778 transitions. [2019-01-11 21:24:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-11 21:24:03,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:03,112 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:03,113 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1516216508, now seen corresponding path program 1 times [2019-01-11 21:24:03,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:03,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:03,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:03,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-11 21:24:03,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:03,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:03,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:03,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:03,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:03,198 INFO L87 Difference]: Start difference. First operand 517 states and 778 transitions. Second operand 3 states. [2019-01-11 21:24:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:03,420 INFO L93 Difference]: Finished difference Result 1052 states and 1586 transitions. [2019-01-11 21:24:03,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:03,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-01-11 21:24:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:03,425 INFO L225 Difference]: With dead ends: 1052 [2019-01-11 21:24:03,425 INFO L226 Difference]: Without dead ends: 542 [2019-01-11 21:24:03,426 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 [2019-01-11 21:24:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-11 21:24:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2019-01-11 21:24:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-01-11 21:24:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 802 transitions. [2019-01-11 21:24:03,443 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 802 transitions. Word has length 168 [2019-01-11 21:24:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:03,443 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 802 transitions. [2019-01-11 21:24:03,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 802 transitions. [2019-01-11 21:24:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-11 21:24:03,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:03,448 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:03,448 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash 648643544, now seen corresponding path program 1 times [2019-01-11 21:24:03,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:03,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-11 21:24:03,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:03,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:03,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:03,530 INFO L87 Difference]: Start difference. First operand 538 states and 802 transitions. Second operand 3 states. [2019-01-11 21:24:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:03,671 INFO L93 Difference]: Finished difference Result 1073 states and 1599 transitions. [2019-01-11 21:24:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:03,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-01-11 21:24:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:03,675 INFO L225 Difference]: With dead ends: 1073 [2019-01-11 21:24:03,675 INFO L226 Difference]: Without dead ends: 540 [2019-01-11 21:24:03,676 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 [2019-01-11 21:24:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-01-11 21:24:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 536. [2019-01-11 21:24:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-01-11 21:24:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 788 transitions. [2019-01-11 21:24:03,692 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 788 transitions. Word has length 169 [2019-01-11 21:24:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:03,692 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 788 transitions. [2019-01-11 21:24:03,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 788 transitions. [2019-01-11 21:24:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 21:24:03,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:03,696 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:03,696 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:03,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:03,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1531494180, now seen corresponding path program 1 times [2019-01-11 21:24:03,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:03,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:03,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:03,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-11 21:24:03,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:03,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:03,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:03,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:03,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:03,802 INFO L87 Difference]: Start difference. First operand 536 states and 788 transitions. Second operand 3 states. [2019-01-11 21:24:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:03,922 INFO L93 Difference]: Finished difference Result 1587 states and 2329 transitions. [2019-01-11 21:24:03,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:03,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-01-11 21:24:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:03,930 INFO L225 Difference]: With dead ends: 1587 [2019-01-11 21:24:03,931 INFO L226 Difference]: Without dead ends: 1058 [2019-01-11 21:24:03,932 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 [2019-01-11 21:24:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-01-11 21:24:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 537. [2019-01-11 21:24:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-01-11 21:24:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 789 transitions. [2019-01-11 21:24:03,956 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 789 transitions. Word has length 184 [2019-01-11 21:24:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:03,956 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 789 transitions. [2019-01-11 21:24:03,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 789 transitions. [2019-01-11 21:24:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 21:24:03,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:03,960 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:03,961 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:03,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash -335214494, now seen corresponding path program 1 times [2019-01-11 21:24:03,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:03,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-11 21:24:04,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:04,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:04,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:04,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:04,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:04,064 INFO L87 Difference]: Start difference. First operand 537 states and 789 transitions. Second operand 3 states. [2019-01-11 21:24:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:04,960 INFO L93 Difference]: Finished difference Result 1595 states and 2344 transitions. [2019-01-11 21:24:04,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:04,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-01-11 21:24:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:04,967 INFO L225 Difference]: With dead ends: 1595 [2019-01-11 21:24:04,968 INFO L226 Difference]: Without dead ends: 1065 [2019-01-11 21:24:04,969 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 [2019-01-11 21:24:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-01-11 21:24:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2019-01-11 21:24:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-01-11 21:24:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1547 transitions. [2019-01-11 21:24:05,011 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1547 transitions. Word has length 184 [2019-01-11 21:24:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:05,012 INFO L480 AbstractCegarLoop]: Abstraction has 1065 states and 1547 transitions. [2019-01-11 21:24:05,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1547 transitions. [2019-01-11 21:24:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-11 21:24:05,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:05,016 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:05,016 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 613712652, now seen corresponding path program 1 times [2019-01-11 21:24:05,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:05,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-11 21:24:05,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:05,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:05,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:05,143 INFO L87 Difference]: Start difference. First operand 1065 states and 1547 transitions. Second operand 3 states. [2019-01-11 21:24:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:05,919 INFO L93 Difference]: Finished difference Result 2651 states and 3860 transitions. [2019-01-11 21:24:05,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:05,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-01-11 21:24:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:05,929 INFO L225 Difference]: With dead ends: 2651 [2019-01-11 21:24:05,929 INFO L226 Difference]: Without dead ends: 1593 [2019-01-11 21:24:05,931 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 [2019-01-11 21:24:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-01-11 21:24:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1593. [2019-01-11 21:24:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-01-11 21:24:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2306 transitions. [2019-01-11 21:24:05,978 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2306 transitions. Word has length 186 [2019-01-11 21:24:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:05,979 INFO L480 AbstractCegarLoop]: Abstraction has 1593 states and 2306 transitions. [2019-01-11 21:24:05,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2306 transitions. [2019-01-11 21:24:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-11 21:24:05,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:05,984 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:05,984 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash 441366398, now seen corresponding path program 1 times [2019-01-11 21:24:05,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:05,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:05,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:05,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:05,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-01-11 21:24:06,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:06,169 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 [2019-01-11 21:24:06,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:06,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-01-11 21:24:06,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:06,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:06,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:06,526 INFO L87 Difference]: Start difference. First operand 1593 states and 2306 transitions. Second operand 5 states. [2019-01-11 21:24:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:09,324 INFO L93 Difference]: Finished difference Result 5825 states and 8426 transitions. [2019-01-11 21:24:09,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:24:09,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-01-11 21:24:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:09,341 INFO L225 Difference]: With dead ends: 5825 [2019-01-11 21:24:09,342 INFO L226 Difference]: Without dead ends: 4195 [2019-01-11 21:24:09,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:24:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-01-11 21:24:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 2389. [2019-01-11 21:24:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-01-11 21:24:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3415 transitions. [2019-01-11 21:24:09,454 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3415 transitions. Word has length 187 [2019-01-11 21:24:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:09,455 INFO L480 AbstractCegarLoop]: Abstraction has 2389 states and 3415 transitions. [2019-01-11 21:24:09,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3415 transitions. [2019-01-11 21:24:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-11 21:24:09,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:09,466 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:09,466 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash 382109115, now seen corresponding path program 1 times [2019-01-11 21:24:09,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:09,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:09,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:09,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-01-11 21:24:09,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:09,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:09,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:09,632 INFO L87 Difference]: Start difference. First operand 2389 states and 3415 transitions. Second operand 3 states. [2019-01-11 21:24:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:10,062 INFO L93 Difference]: Finished difference Result 5358 states and 7670 transitions. [2019-01-11 21:24:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:10,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-01-11 21:24:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:10,076 INFO L225 Difference]: With dead ends: 5358 [2019-01-11 21:24:10,076 INFO L226 Difference]: Without dead ends: 2976 [2019-01-11 21:24:10,079 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 [2019-01-11 21:24:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-01-11 21:24:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2976. [2019-01-11 21:24:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-01-11 21:24:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4248 transitions. [2019-01-11 21:24:10,189 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4248 transitions. Word has length 286 [2019-01-11 21:24:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:10,190 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 4248 transitions. [2019-01-11 21:24:10,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4248 transitions. [2019-01-11 21:24:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-11 21:24:10,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:10,198 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:10,199 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash 630255609, now seen corresponding path program 1 times [2019-01-11 21:24:10,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:10,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:10,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-01-11 21:24:10,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:10,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:10,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:10,336 INFO L87 Difference]: Start difference. First operand 2976 states and 4248 transitions. Second operand 3 states. [2019-01-11 21:24:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:10,872 INFO L93 Difference]: Finished difference Result 6501 states and 9297 transitions. [2019-01-11 21:24:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:10,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-01-11 21:24:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:10,899 INFO L225 Difference]: With dead ends: 6501 [2019-01-11 21:24:10,901 INFO L226 Difference]: Without dead ends: 3532 [2019-01-11 21:24:10,905 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 [2019-01-11 21:24:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2019-01-11 21:24:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 3532. [2019-01-11 21:24:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2019-01-11 21:24:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 5038 transitions. [2019-01-11 21:24:11,023 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 5038 transitions. Word has length 286 [2019-01-11 21:24:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:11,024 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 5038 transitions. [2019-01-11 21:24:11,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 5038 transitions. [2019-01-11 21:24:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-11 21:24:11,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:11,030 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:11,030 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1447081289, now seen corresponding path program 1 times [2019-01-11 21:24:11,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:11,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:11,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-01-11 21:24:11,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:11,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:11,180 INFO L87 Difference]: Start difference. First operand 3532 states and 5038 transitions. Second operand 3 states. [2019-01-11 21:24:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:12,219 INFO L93 Difference]: Finished difference Result 7615 states and 10879 transitions. [2019-01-11 21:24:12,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:12,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-01-11 21:24:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:12,233 INFO L225 Difference]: With dead ends: 7615 [2019-01-11 21:24:12,233 INFO L226 Difference]: Without dead ends: 4090 [2019-01-11 21:24:12,238 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 [2019-01-11 21:24:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2019-01-11 21:24:12,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4090. [2019-01-11 21:24:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4090 states. [2019-01-11 21:24:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 5830 transitions. [2019-01-11 21:24:12,333 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 5830 transitions. Word has length 286 [2019-01-11 21:24:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:12,333 INFO L480 AbstractCegarLoop]: Abstraction has 4090 states and 5830 transitions. [2019-01-11 21:24:12,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 5830 transitions. [2019-01-11 21:24:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-11 21:24:12,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:12,339 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:12,339 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 874720629, now seen corresponding path program 1 times [2019-01-11 21:24:12,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:12,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:12,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:12,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2019-01-11 21:24:12,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:12,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:12,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:12,465 INFO L87 Difference]: Start difference. First operand 4090 states and 5830 transitions. Second operand 3 states. [2019-01-11 21:24:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:13,236 INFO L93 Difference]: Finished difference Result 8733 states and 12465 transitions. [2019-01-11 21:24:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:13,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-01-11 21:24:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:13,247 INFO L225 Difference]: With dead ends: 8733 [2019-01-11 21:24:13,248 INFO L226 Difference]: Without dead ends: 4650 [2019-01-11 21:24:13,253 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 [2019-01-11 21:24:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2019-01-11 21:24:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4650. [2019-01-11 21:24:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4650 states. [2019-01-11 21:24:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 6624 transitions. [2019-01-11 21:24:13,405 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 6624 transitions. Word has length 286 [2019-01-11 21:24:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:13,405 INFO L480 AbstractCegarLoop]: Abstraction has 4650 states and 6624 transitions. [2019-01-11 21:24:13,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 6624 transitions. [2019-01-11 21:24:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-01-11 21:24:13,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:13,415 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:13,415 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1635721041, now seen corresponding path program 1 times [2019-01-11 21:24:13,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:13,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 842 proven. 0 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-01-11 21:24:13,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:13,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:13,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:13,817 INFO L87 Difference]: Start difference. First operand 4650 states and 6624 transitions. Second operand 3 states. [2019-01-11 21:24:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:14,243 INFO L93 Difference]: Finished difference Result 12648 states and 17917 transitions. [2019-01-11 21:24:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:14,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 434 [2019-01-11 21:24:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:14,262 INFO L225 Difference]: With dead ends: 12648 [2019-01-11 21:24:14,263 INFO L226 Difference]: Without dead ends: 8005 [2019-01-11 21:24:14,270 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 [2019-01-11 21:24:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8005 states. [2019-01-11 21:24:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8005 to 8003. [2019-01-11 21:24:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-01-11 21:24:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 11284 transitions. [2019-01-11 21:24:14,467 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 11284 transitions. Word has length 434 [2019-01-11 21:24:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:14,467 INFO L480 AbstractCegarLoop]: Abstraction has 8003 states and 11284 transitions. [2019-01-11 21:24:14,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 11284 transitions. [2019-01-11 21:24:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-01-11 21:24:14,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:14,482 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:14,482 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash -7772346, now seen corresponding path program 1 times [2019-01-11 21:24:14,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:14,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:14,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:14,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3069 backedges. 1596 proven. 26 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2019-01-11 21:24:14,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:14,786 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 [2019-01-11 21:24:14,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:14,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3069 backedges. 1437 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2019-01-11 21:24:15,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:15,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:15,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:15,235 INFO L87 Difference]: Start difference. First operand 8003 states and 11284 transitions. Second operand 5 states. [2019-01-11 21:24:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:16,526 INFO L93 Difference]: Finished difference Result 18691 states and 26495 transitions. [2019-01-11 21:24:16,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:24:16,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 533 [2019-01-11 21:24:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:16,549 INFO L225 Difference]: With dead ends: 18691 [2019-01-11 21:24:16,549 INFO L226 Difference]: Without dead ends: 9729 [2019-01-11 21:24:16,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:24:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2019-01-11 21:24:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 7703. [2019-01-11 21:24:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2019-01-11 21:24:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10675 transitions. [2019-01-11 21:24:16,884 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10675 transitions. Word has length 533 [2019-01-11 21:24:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:16,885 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10675 transitions. [2019-01-11 21:24:16,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10675 transitions. [2019-01-11 21:24:16,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-01-11 21:24:16,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:16,897 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:16,898 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash 907719866, now seen corresponding path program 1 times [2019-01-11 21:24:16,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:16,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 2120 proven. 0 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2019-01-11 21:24:17,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:17,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:17,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:17,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:17,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,176 INFO L87 Difference]: Start difference. First operand 7703 states and 10675 transitions. Second operand 3 states. [2019-01-11 21:24:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:17,953 INFO L93 Difference]: Finished difference Result 15559 states and 21531 transitions. [2019-01-11 21:24:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:17,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 564 [2019-01-11 21:24:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:17,980 INFO L225 Difference]: With dead ends: 15559 [2019-01-11 21:24:17,980 INFO L226 Difference]: Without dead ends: 7863 [2019-01-11 21:24:17,992 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 [2019-01-11 21:24:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2019-01-11 21:24:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 7703. [2019-01-11 21:24:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2019-01-11 21:24:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10535 transitions. [2019-01-11 21:24:18,452 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10535 transitions. Word has length 564 [2019-01-11 21:24:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:18,454 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10535 transitions. [2019-01-11 21:24:18,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10535 transitions. [2019-01-11 21:24:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2019-01-11 21:24:18,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:18,475 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:18,475 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 264667892, now seen corresponding path program 1 times [2019-01-11 21:24:18,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:18,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3853 backedges. 2121 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2019-01-11 21:24:18,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:18,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:18,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:18,878 INFO L87 Difference]: Start difference. First operand 7703 states and 10535 transitions. Second operand 3 states. [2019-01-11 21:24:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:19,327 INFO L93 Difference]: Finished difference Result 15588 states and 21276 transitions. [2019-01-11 21:24:19,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:19,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 578 [2019-01-11 21:24:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:19,345 INFO L225 Difference]: With dead ends: 15588 [2019-01-11 21:24:19,345 INFO L226 Difference]: Without dead ends: 7892 [2019-01-11 21:24:19,355 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 [2019-01-11 21:24:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-01-11 21:24:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7703. [2019-01-11 21:24:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2019-01-11 21:24:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10429 transitions. [2019-01-11 21:24:19,671 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10429 transitions. Word has length 578 [2019-01-11 21:24:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:19,672 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10429 transitions. [2019-01-11 21:24:19,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10429 transitions. [2019-01-11 21:24:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-01-11 21:24:19,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:19,691 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 9, 7, 7, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:19,691 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1121952208, now seen corresponding path program 1 times [2019-01-11 21:24:19,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:19,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4327 backedges. 2362 proven. 0 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2019-01-11 21:24:19,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:19,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:19,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:19,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:19,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:19,957 INFO L87 Difference]: Start difference. First operand 7703 states and 10429 transitions. Second operand 3 states. [2019-01-11 21:24:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:20,387 INFO L93 Difference]: Finished difference Result 15511 states and 20973 transitions. [2019-01-11 21:24:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:20,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 618 [2019-01-11 21:24:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:20,395 INFO L225 Difference]: With dead ends: 15511 [2019-01-11 21:24:20,395 INFO L226 Difference]: Without dead ends: 7815 [2019-01-11 21:24:20,403 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 [2019-01-11 21:24:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7815 states. [2019-01-11 21:24:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7815 to 7703. [2019-01-11 21:24:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2019-01-11 21:24:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10401 transitions. [2019-01-11 21:24:20,776 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10401 transitions. Word has length 618 [2019-01-11 21:24:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:20,776 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10401 transitions. [2019-01-11 21:24:20,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10401 transitions. [2019-01-11 21:24:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-01-11 21:24:20,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:20,795 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 20, 20, 20, 18, 18, 16, 16, 14, 14, 12, 12, 12, 12, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:20,795 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -555578645, now seen corresponding path program 1 times [2019-01-11 21:24:20,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:20,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 2741 proven. 0 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2019-01-11 21:24:21,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:21,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:21,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:21,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:21,035 INFO L87 Difference]: Start difference. First operand 7703 states and 10401 transitions. Second operand 3 states. [2019-01-11 21:24:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:21,292 INFO L93 Difference]: Finished difference Result 11393 states and 15371 transitions. [2019-01-11 21:24:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:21,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 647 [2019-01-11 21:24:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:21,301 INFO L225 Difference]: With dead ends: 11393 [2019-01-11 21:24:21,301 INFO L226 Difference]: Without dead ends: 7749 [2019-01-11 21:24:21,306 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 [2019-01-11 21:24:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7749 states. [2019-01-11 21:24:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7749 to 7749. [2019-01-11 21:24:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7749 states. [2019-01-11 21:24:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7749 states to 7749 states and 10452 transitions. [2019-01-11 21:24:21,690 INFO L78 Accepts]: Start accepts. Automaton has 7749 states and 10452 transitions. Word has length 647 [2019-01-11 21:24:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:21,691 INFO L480 AbstractCegarLoop]: Abstraction has 7749 states and 10452 transitions. [2019-01-11 21:24:21,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7749 states and 10452 transitions. [2019-01-11 21:24:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-01-11 21:24:21,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:21,702 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 20, 20, 20, 18, 18, 16, 16, 14, 14, 12, 12, 12, 12, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:21,702 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1827923157, now seen corresponding path program 1 times [2019-01-11 21:24:21,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:21,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 2739 proven. 0 refuted. 0 times theorem prover too weak. 1967 trivial. 0 not checked. [2019-01-11 21:24:22,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:22,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:22,019 INFO L87 Difference]: Start difference. First operand 7749 states and 10452 transitions. Second operand 3 states. [2019-01-11 21:24:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:22,501 INFO L93 Difference]: Finished difference Result 11485 states and 15473 transitions. [2019-01-11 21:24:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:22,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 648 [2019-01-11 21:24:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:22,511 INFO L225 Difference]: With dead ends: 11485 [2019-01-11 21:24:22,511 INFO L226 Difference]: Without dead ends: 7795 [2019-01-11 21:24:22,515 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 [2019-01-11 21:24:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2019-01-11 21:24:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 7795. [2019-01-11 21:24:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7795 states. [2019-01-11 21:24:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7795 states to 7795 states and 10503 transitions. [2019-01-11 21:24:22,710 INFO L78 Accepts]: Start accepts. Automaton has 7795 states and 10503 transitions. Word has length 648 [2019-01-11 21:24:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:22,711 INFO L480 AbstractCegarLoop]: Abstraction has 7795 states and 10503 transitions. [2019-01-11 21:24:22,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7795 states and 10503 transitions. [2019-01-11 21:24:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2019-01-11 21:24:22,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:22,723 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 31, 31, 31, 28, 28, 25, 25, 22, 22, 19, 19, 19, 19, 16, 13, 13, 10, 10, 7, 7, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:22,723 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash -760233511, now seen corresponding path program 1 times [2019-01-11 21:24:22,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:22,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:22,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:22,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:22,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11676 backedges. 5840 proven. 0 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2019-01-11 21:24:23,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:23,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:23,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:23,198 INFO L87 Difference]: Start difference. First operand 7795 states and 10503 transitions. Second operand 3 states. [2019-01-11 21:24:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:23,538 INFO L93 Difference]: Finished difference Result 15833 states and 21340 transitions. [2019-01-11 21:24:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:23,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1009 [2019-01-11 21:24:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:23,547 INFO L225 Difference]: With dead ends: 15833 [2019-01-11 21:24:23,547 INFO L226 Difference]: Without dead ends: 7991 [2019-01-11 21:24:23,553 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 [2019-01-11 21:24:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2019-01-11 21:24:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 7921. [2019-01-11 21:24:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7921 states. [2019-01-11 21:24:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 10614 transitions. [2019-01-11 21:24:23,817 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 10614 transitions. Word has length 1009 [2019-01-11 21:24:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:23,817 INFO L480 AbstractCegarLoop]: Abstraction has 7921 states and 10614 transitions. [2019-01-11 21:24:23,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 10614 transitions. [2019-01-11 21:24:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2019-01-11 21:24:23,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:23,834 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 34, 34, 34, 34, 34, 34, 31, 31, 31, 28, 28, 25, 25, 22, 22, 19, 19, 19, 19, 16, 13, 13, 10, 10, 7, 7, 4, 4, 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, 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] [2019-01-11 21:24:23,834 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1252321953, now seen corresponding path program 1 times [2019-01-11 21:24:23,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12163 backedges. 5892 proven. 0 refuted. 0 times theorem prover too weak. 6271 trivial. 0 not checked. [2019-01-11 21:24:24,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:24,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:24,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:24,538 INFO L87 Difference]: Start difference. First operand 7921 states and 10614 transitions. Second operand 3 states. [2019-01-11 21:24:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:24,894 INFO L93 Difference]: Finished difference Result 15015 states and 20100 transitions. [2019-01-11 21:24:24,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:24,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1039 [2019-01-11 21:24:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:24,895 INFO L225 Difference]: With dead ends: 15015 [2019-01-11 21:24:24,896 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:24:24,902 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 [2019-01-11 21:24:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:24:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:24:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:24:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:24:24,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1039 [2019-01-11 21:24:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:24,904 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:24:24,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:24:24,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:24:24,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:24:24,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:24,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:24,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,061 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 123 [2019-01-11 21:24:25,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,251 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 153 [2019-01-11 21:24:25,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,400 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 131 [2019-01-11 21:24:25,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,666 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 153 [2019-01-11 21:24:25,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,798 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 124 [2019-01-11 21:24:25,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:25,917 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 153 [2019-01-11 21:24:26,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,771 WARN L181 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 645 DAG size of output: 133 [2019-01-11 21:24:26,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:26,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,442 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 252 [2019-01-11 21:24:27,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:27,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,017 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 645 DAG size of output: 133 [2019-01-11 21:24:28,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:28,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:29,292 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 121 DAG size of output: 63 [2019-01-11 21:24:29,884 WARN L181 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-01-11 21:24:30,503 WARN L181 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2019-01-11 21:24:31,733 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2019-01-11 21:24:32,389 WARN L181 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2019-01-11 21:24:33,131 WARN L181 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-01-11 21:24:33,783 WARN L181 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 38 [2019-01-11 21:24:34,454 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2019-01-11 21:24:35,039 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2019-01-11 21:24:35,589 WARN L181 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 94 [2019-01-11 21:24:35,973 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 44 [2019-01-11 21:24:36,660 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 56 [2019-01-11 21:24:37,131 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 31 [2019-01-11 21:24:37,646 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-01-11 21:24:41,698 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 251 DAG size of output: 102 [2019-01-11 21:24:42,371 WARN L181 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2019-01-11 21:24:42,831 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2019-01-11 21:24:43,202 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 44 [2019-01-11 21:24:43,805 WARN L181 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-01-11 21:24:44,482 WARN L181 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 56 [2019-01-11 21:24:45,105 WARN L181 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 56 [2019-01-11 21:24:45,448 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2019-01-11 21:24:45,451 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 574) no Hoare annotation was computed. [2019-01-11 21:24:45,451 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 374) no Hoare annotation was computed. [2019-01-11 21:24:45,452 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 606) no Hoare annotation was computed. [2019-01-11 21:24:45,452 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 617) no Hoare annotation was computed. [2019-01-11 21:24:45,452 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 628) no Hoare annotation was computed. [2019-01-11 21:24:45,452 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 639) no Hoare annotation was computed. [2019-01-11 21:24:45,452 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 666) no Hoare annotation was computed. [2019-01-11 21:24:45,452 INFO L448 ceAbstractionStarter]: For program point L664-2(lines 664 666) no Hoare annotation was computed. [2019-01-11 21:24:45,452 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 513) no Hoare annotation was computed. [2019-01-11 21:24:45,453 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 607) the Hoare annotation is: (let ((.cse0 (and (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 11)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) .cse1) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1))) [2019-01-11 21:24:45,453 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 639) the Hoare annotation is: (let ((.cse0 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)))) [2019-01-11 21:24:45,453 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 547) no Hoare annotation was computed. [2019-01-11 21:24:45,453 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-01-11 21:24:45,453 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 573) no Hoare annotation was computed. [2019-01-11 21:24:45,454 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 443) no Hoare annotation was computed. [2019-01-11 21:24:45,454 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 373) no Hoare annotation was computed. [2019-01-11 21:24:45,454 INFO L448 ceAbstractionStarter]: For program point L336-1(lines 336 373) no Hoare annotation was computed. [2019-01-11 21:24:45,454 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 605) no Hoare annotation was computed. [2019-01-11 21:24:45,454 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 616) no Hoare annotation was computed. [2019-01-11 21:24:45,454 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 627) no Hoare annotation was computed. [2019-01-11 21:24:45,454 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 638) no Hoare annotation was computed. [2019-01-11 21:24:45,455 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 512) no Hoare annotation was computed. [2019-01-11 21:24:45,455 INFO L444 ceAbstractionStarter]: At program point L403(lines 394 415) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) .cse3) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13))) [2019-01-11 21:24:45,455 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 370) no Hoare annotation was computed. [2019-01-11 21:24:45,455 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 314) no Hoare annotation was computed. [2019-01-11 21:24:45,455 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 314) no Hoare annotation was computed. [2019-01-11 21:24:45,456 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 605) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:45,456 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 617) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (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)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 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 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 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 (= 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 (= 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)))) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse2)) (and .cse0 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)))) [2019-01-11 21:24:45,456 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 628) the Hoare annotation is: (let ((.cse2 (and (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 (= 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 (= 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)))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse0 (and .cse2 .cse3)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse2 .cse3) .cse1) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6))))) [2019-01-11 21:24:45,456 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 546) no Hoare annotation was computed. [2019-01-11 21:24:45,456 INFO L451 ceAbstractionStarter]: At program point L669(lines 11 671) the Hoare annotation is: true [2019-01-11 21:24:45,457 INFO L444 ceAbstractionStarter]: At program point L603(lines 99 658) the Hoare annotation is: (let ((.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 .cse1 (and (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 11)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656) .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 10)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) (and (and (= 12 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 572) no Hoare annotation was computed. [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L570-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 441) no Hoare annotation was computed. [2019-01-11 21:24:45,457 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 605) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 615) no Hoare annotation was computed. [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 626) no Hoare annotation was computed. [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 637) no Hoare annotation was computed. [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 511) no Hoare annotation was computed. [2019-01-11 21:24:45,457 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L505-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L472-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L406-2(lines 402 415) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 545) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 306 314) no Hoare annotation was computed. [2019-01-11 21:24:45,458 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 368) no Hoare annotation was computed. [2019-01-11 21:24:45,459 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-11 21:24:45,459 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 614) no Hoare annotation was computed. [2019-01-11 21:24:45,459 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 625) no Hoare annotation was computed. [2019-01-11 21:24:45,459 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 636) no Hoare annotation was computed. [2019-01-11 21:24:45,459 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 656) no Hoare annotation was computed. [2019-01-11 21:24:45,459 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 510) no Hoare annotation was computed. [2019-01-11 21:24:45,459 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-11 21:24:45,460 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 638) the Hoare annotation is: (let ((.cse7 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse25 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8)) (.cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (.cse28 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse16 .cse4 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)) (.cse30 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse16 .cse4 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse28 .cse29) (and .cse5 .cse29) (and .cse29 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse30) (and .cse29 .cse30)))) [2019-01-11 21:24:45,460 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 615) the Hoare annotation is: (let ((.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8545 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)))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse1 (and .cse3 .cse4 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse17 .cse18 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse19 .cse11 .cse20 .cse12 .cse21 .cse22 .cse13 .cse14 .cse15 .cse16)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9))))) [2019-01-11 21:24:45,460 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 626) 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))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8528 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 (= 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))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13))) [2019-01-11 21:24:45,460 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 655) no Hoare annotation was computed. [2019-01-11 21:24:45,460 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 544) no Hoare annotation was computed. [2019-01-11 21:24:45,460 INFO L444 ceAbstractionStarter]: At program point L509(lines 72 670) the Hoare annotation is: false [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L542-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 641 655) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 613) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 624) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 635) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 646) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:45,461 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 612) no Hoare annotation was computed. [2019-01-11 21:24:45,462 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 623) no Hoare annotation was computed. [2019-01-11 21:24:45,462 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:45,462 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 634) no Hoare annotation was computed. [2019-01-11 21:24:45,462 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 584) no Hoare annotation was computed. [2019-01-11 21:24:45,462 INFO L448 ceAbstractionStarter]: For program point L580-2(lines 580 584) no Hoare annotation was computed. [2019-01-11 21:24:45,462 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 417) no Hoare annotation was computed. [2019-01-11 21:24:45,462 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 613) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (and (not (= 8497 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 (= 12292 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 (= 8448 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 (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 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 (= 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))))) (or (and .cse0 .cse1 (and .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5))) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1 .cse2))) [2019-01-11 21:24:45,463 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 624) the Hoare annotation is: (let ((.cse0 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 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 (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 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 (= 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)))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (and .cse0 .cse1))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse0 .cse1) .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse2 .cse3) (and .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse3) (and .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse2 .cse3)))) [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L449-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L451 ceAbstractionStarter]: At program point L681(lines 672 683) the Hoare annotation is: true [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 611) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 622) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 633) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L649(lines 649 653) no Hoare annotation was computed. [2019-01-11 21:24:45,463 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 486) no Hoare annotation was computed. [2019-01-11 21:24:45,464 INFO L448 ceAbstractionStarter]: For program point L484-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,464 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 634) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 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 (= 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))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13))) [2019-01-11 21:24:45,464 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2019-01-11 21:24:45,464 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2019-01-11 21:24:45,464 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 364) no Hoare annotation was computed. [2019-01-11 21:24:45,464 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-11 21:24:45,464 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-11 21:24:45,464 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,469 INFO L444 ceAbstractionStarter]: At program point L354(lines 330 375) the Hoare annotation is: (let ((.cse0 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 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 (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 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 (= 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)))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (and .cse0 .cse1))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse0 .cse1) .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse2 .cse3) (and .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse3) (and .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse2 .cse3)))) [2019-01-11 21:24:45,469 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 610) no Hoare annotation was computed. [2019-01-11 21:24:45,469 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 621) no Hoare annotation was computed. [2019-01-11 21:24:45,469 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 632) no Hoare annotation was computed. [2019-01-11 21:24:45,469 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-11 21:24:45,469 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 670) no Hoare annotation was computed. [2019-01-11 21:24:45,470 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 556) no Hoare annotation was computed. [2019-01-11 21:24:45,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:24:45,470 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 611) the Hoare annotation is: (let ((.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8545 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)))) (let ((.cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse20 .cse12 .cse21 .cse22 .cse13 .cse14 .cse15 .cse16)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 .cse2) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) .cse1 .cse2) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6))))) [2019-01-11 21:24:45,470 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 622) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) .cse3) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13))) [2019-01-11 21:24:45,471 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 632) 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 (= 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13 .cse14))) [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 467) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 353 362) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 609) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 620) no Hoare annotation was computed. [2019-01-11 21:24:45,471 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 631) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L444 ceAbstractionStarter]: At program point L391(lines 382 417) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) .cse3) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13))) [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 602) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L590(lines 590 596) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L590-1(lines 590 596) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 461) no Hoare annotation was computed. [2019-01-11 21:24:45,472 INFO L448 ceAbstractionStarter]: For program point L459-2(lines 457 467) no Hoare annotation was computed. [2019-01-11 21:24:45,473 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-11 21:24:45,473 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 608) no Hoare annotation was computed. [2019-01-11 21:24:45,473 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 619) no Hoare annotation was computed. [2019-01-11 21:24:45,473 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 630) no Hoare annotation was computed. [2019-01-11 21:24:45,473 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-01-11 21:24:45,473 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 415) no Hoare annotation was computed. [2019-01-11 21:24:45,473 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 609) the Hoare annotation is: (let ((.cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (and (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1 .cse2)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse1 .cse2) (and .cse2 .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656) (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 10)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9))))) [2019-01-11 21:24:45,473 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 620) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 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 (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-01-11 21:24:45,474 INFO L451 ceAbstractionStarter]: At program point L659(lines 98 660) the Hoare annotation is: true [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L593(lines 593 595) no Hoare annotation was computed. [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 575) no Hoare annotation was computed. [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 531) no Hoare annotation was computed. [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 607) no Hoare annotation was computed. [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 618) no Hoare annotation was computed. [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 629) no Hoare annotation was computed. [2019-01-11 21:24:45,474 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 658) the Hoare annotation is: (let ((.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 .cse1 (and (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 11)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656) .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 10)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) (and (and (= 12 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-01-11 21:24:45,474 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 514) no Hoare annotation was computed. [2019-01-11 21:24:45,475 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-11 21:24:45,475 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 618) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (not (= 8497 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 (= 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)) (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) (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)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:24:45,475 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 631) 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))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse15) .cse2))) [2019-01-11 21:24:45,475 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:24:45,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:24:45 BoogieIcfgContainer [2019-01-11 21:24:45,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:24:45,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:24:45,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:24:45,622 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:24:45,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:47" (3/4) ... [2019-01-11 21:24:45,628 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:24:45,674 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:24:45,680 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:24:45,917 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:24:45,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:24:45,918 INFO L168 Benchmark]: Toolchain (without parser) took 60385.34 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 954.0 MB in the beginning and 1.9 GB in the end (delta: -911.8 MB). Peak memory consumption was 871.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:45,918 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-11 21:24:45,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.22 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:45,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:45,919 INFO L168 Benchmark]: Boogie Preprocessor took 72.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:45,919 INFO L168 Benchmark]: RCFGBuilder took 1424.75 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: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:45,920 INFO L168 Benchmark]: TraceAbstraction took 57852.10 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -805.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-11 21:24:45,920 INFO L168 Benchmark]: Witness Printer took 295.55 ms. Allocated memory is still 2.8 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:45,922 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.16 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 559.22 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 175.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1424.75 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: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57852.10 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -805.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 295.55 ms. Allocated memory is still 2.8 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: 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: 126]: 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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && 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)) && !(8448 == s__state)) && blastFlag == 7) && !(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)) && blastFlag == 6) && !(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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && blastFlag == 8) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((8448 <= s__state && s__state <= 8448) && blastFlag == 8) || ((8448 <= s__state && s__state <= 8448) && blastFlag == 7)) || ((8448 <= s__state && s__state <= 8448) && blastFlag <= 5)) || ((8448 <= s__state && s__state <= 8448) && blastFlag == 6)) || ((8448 <= s__state && s__state <= 8448) && blastFlag == 9)) || (((((((((((((((!(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)) && s__hit == 0) && !(8576 == s__state)) && s__s3__tmp__next_state___0 <= 3) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 5 && ((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) || ((blastFlag == 7 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && blastFlag == 6) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && blastFlag == 9)) || ((blastFlag == 8 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(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)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (((((((((((((((!(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)) && s__hit == 0) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (((((((((((((((!(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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(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)) && !(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 == 9) && s__state <= 8576)) || (((((((((((((((!(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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && blastFlag == 8) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= 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 == 9) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(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 <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= 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 == 8) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8656) && blastFlag == 8) && 8448 <= s__state) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 7) && s__state <= 8656) && 8448 <= s__state)) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 9) && s__state <= 8656) && 8448 <= s__state)) || ((s__state <= 8656 && 8448 <= s__state) && (((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == 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)) && blastFlag <= 5)) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8656) && 8448 <= s__state) && blastFlag == 6) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && blastFlag == 8) && 8656 <= s__state) || ((((s__state <= 8672 && (!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && s__hit == 0) && 8656 <= s__state) && blastFlag == 11)) || ((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && 8656 <= s__state) && blastFlag == 9)) || ((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && blastFlag <= 5) && 8656 <= s__state)) || ((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && blastFlag == 6) && 8656 <= s__state)) || ((blastFlag == 7 && (!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && 8656 <= s__state) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= 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 == 9) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(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 <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= 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 == 8) && s__state <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 5 && ((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) || ((blastFlag == 7 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && blastFlag == 6) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && blastFlag == 9)) || ((blastFlag == 8 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((s__state <= 3 || ((((s__state <= 8672 && s__hit == 0) && 8656 <= s__state) && !(8657 == s__state) && !(8656 == s__state)) && blastFlag == 11)) || blastFlag == 7) || blastFlag == 8) || (((s__state <= 8656 && s__hit == 0) && 8656 <= s__state) && blastFlag == 10)) || blastFlag == 6) || blastFlag <= 5) || blastFlag == 9) || ((((12 == blastFlag && s__hit == 0) && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((s__state <= 8656 && 8448 <= s__state) && (((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 5) || (((blastFlag == 7 && s__state <= 8656) && 8448 <= s__state) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__state <= 8656 && 8448 <= s__state) && blastFlag == 6) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__state <= 8656 && 8448 <= s__state) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 9)) || (((s__state <= 8656 && blastFlag == 8) && 8448 <= s__state) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(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)) && !(8528 == s__state)) && 8448 <= 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)) && blastFlag == 8) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= 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 == 9) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= 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 <= 5) && s__state <= 8576) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag <= 5) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 8)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 6)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 9)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 7) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((blastFlag == 7 && s__state <= 8656) && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8656 == s__state)) && s__state <= 8656) && !(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)) && blastFlag <= 5)) || (((s__state <= 8656 && blastFlag == 8) && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 6)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 9) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 8) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 6)) || (((((((((((((((((((((((((!(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)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5)) || (blastFlag == 7 && ((((((((((((((((((((((((!(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))) || (blastFlag == 8 && ((((((((((((((((((((((((!(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))) || ((((((((((((((((((((((((((!(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)) && blastFlag == 6)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 7)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 9)) || ((((((((((((((((((((((((((!(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)) && blastFlag == 9) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= 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 == 9) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(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 <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= 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 == 8) && s__state <= 8576) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) && blastFlag == 9) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && blastFlag == 8) && 8448 <= s__state)) || ((blastFlag == 7 && (((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || (((blastFlag <= 5 && ((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) && blastFlag == 6) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((s__state <= 3 || ((((s__state <= 8672 && s__hit == 0) && 8656 <= s__state) && !(8657 == s__state) && !(8656 == s__state)) && blastFlag == 11)) || blastFlag == 7) || blastFlag == 8) || (((s__state <= 8656 && s__hit == 0) && 8656 <= s__state) && blastFlag == 10)) || blastFlag == 6) || blastFlag <= 5) || blastFlag == 9) || ((((12 == blastFlag && s__hit == 0) && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((s__state <= 8656 && 8448 <= s__state) && blastFlag <= 5 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 8) && 8448 <= s__state)) || (((blastFlag == 7 && s__state <= 8656) && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 6)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 9) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 159]: 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)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && 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)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && 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)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && blastFlag == 8) && !(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)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == 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)) && blastFlag == 6) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 8) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == 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)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && (blastFlag == 8 && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state) || (((s__state <= 8672 && blastFlag == 6) && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state)) || (((8656 <= s__state && !(8672 == s__state)) && s__state <= 8672) && blastFlag <= 5)) || (((s__state <= 8672 && blastFlag == 7) && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state)) || (((s__state <= 8656 && s__hit == 0) && 8656 <= s__state) && blastFlag == 10)) || (((s__state <= 8672 && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state) && blastFlag == 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 157 locations, 1 error locations. SAFE Result, 57.6s OverallTime, 43 OverallIterations, 36 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 20.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 9374 SDtfs, 7699 SDslu, 4058 SDs, 0 SdLazy, 4350 SolverSat, 1694 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8003occurred in iteration=35, 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: 3.6s AutomataMinimizationTime, 43 MinimizatonAttempts, 5028 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 800 NumberOfFragments, 6678 HoareAnnotationTreeSize, 28 FomulaSimplifications, 621655 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 146347 FormulaSimplificationTreeSizeReductionInter, 17.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 11570 NumberOfCodeBlocks, 11570 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 11525 ConstructedInterpolants, 0 QuantifiedInterpolants, 6648076 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1193 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 45 InterpolantComputations, 43 PerfectInterpolantSequences, 61080/61132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...