./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_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_4_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 a9636d7d6107e60711fab246dfc2abf2798468aa .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:43,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:23:43,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:23:43,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:23:43,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:23:43,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:23:43,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:23:43,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:23:43,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:23:43,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:23:43,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:23:43,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:23:43,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:23:43,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:23:43,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:23:43,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:23:43,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:23:43,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:23:43,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:23:43,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:23:43,781 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:23:43,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:23:43,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:23:43,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:23:43,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:23:43,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:23:43,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:23:43,793 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:23:43,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:23:43,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:23:43,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:23:43,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:23:43,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:23:43,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:23:43,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:23:43,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:23:43,804 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:43,838 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:23:43,838 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:23:43,839 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:23:43,839 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:23:43,840 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:23:43,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:23:43,842 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:23:43,842 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:23:43,842 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:23:43,842 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:23:43,842 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:23:43,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:23:43,844 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:23:43,844 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:23:43,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:23:43,844 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:23:43,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:23:43,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:23:43,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:23:43,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:23:43,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:23:43,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:43,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:23:43,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:23:43,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:23:43,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:23:43,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:23:43,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:23:43,848 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 -> a9636d7d6107e60711fab246dfc2abf2798468aa [2019-01-11 21:23:43,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:23:43,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:23:43,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:23:43,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:23:43,933 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:23:43,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:43,982 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1897ca8/ccb86346d5b04e7d9b70152c5ce89870/FLAG3ad055127 [2019-01-11 21:23:44,469 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:23:44,471 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:44,489 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1897ca8/ccb86346d5b04e7d9b70152c5ce89870/FLAG3ad055127 [2019-01-11 21:23:44,777 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1897ca8/ccb86346d5b04e7d9b70152c5ce89870 [2019-01-11 21:23:44,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:23:44,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:23:44,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:44,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:23:44,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:23:44,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:44" (1/1) ... [2019-01-11 21:23:44,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba7b51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:44, skipping insertion in model container [2019-01-11 21:23:44,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:44" (1/1) ... [2019-01-11 21:23:44,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:23:44,863 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:23:45,153 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:45,159 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:23:45,239 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:45,255 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:23:45,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:45 WrapperNode [2019-01-11 21:23:45,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:45,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:45,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:23:45,257 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:23:45,266 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:45" (1/1) ... [2019-01-11 21:23:45,278 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:45" (1/1) ... [2019-01-11 21:23:45,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:45,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:23:45,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:23:45,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:23:45,402 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:45" (1/1) ... [2019-01-11 21:23:45,402 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:45" (1/1) ... [2019-01-11 21:23:45,406 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:45" (1/1) ... [2019-01-11 21:23:45,406 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:45" (1/1) ... [2019-01-11 21:23:45,414 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:45" (1/1) ... [2019-01-11 21:23:45,423 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:45" (1/1) ... [2019-01-11 21:23:45,426 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:45" (1/1) ... [2019-01-11 21:23:45,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:23:45,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:23:45,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:23:45,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:23:45,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:45" (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:45,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:23:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:23:45,719 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:23:46,862 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:23:46,863 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:23:46,865 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:23:46,865 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:23:46,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:46 BoogieIcfgContainer [2019-01-11 21:23:46,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:23:46,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:23:46,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:23:46,872 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:23:46,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:23:44" (1/3) ... [2019-01-11 21:23:46,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257afcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:46, skipping insertion in model container [2019-01-11 21:23:46,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:45" (2/3) ... [2019-01-11 21:23:46,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257afcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:46, skipping insertion in model container [2019-01-11 21:23:46,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:46" (3/3) ... [2019-01-11 21:23:46,876 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_4_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:46,885 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:23:46,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:23:46,908 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:23:46,941 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:23:46,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:23:46,942 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:23:46,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:23:46,943 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:23:46,943 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:23:46,943 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:23:46,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:23:46,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:23:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-01-11 21:23:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:23:46,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:46,975 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:46,978 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:46,984 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-01-11 21:23:46,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:46,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:47,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:47,251 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:47,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:47,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:47,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,277 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-01-11 21:23:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:48,065 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-01-11 21:23:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:48,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:23:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:48,083 INFO L225 Difference]: With dead ends: 327 [2019-01-11 21:23:48,083 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 21:23:48,088 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:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 21:23:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-01-11 21:23:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-11 21:23:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-01-11 21:23:48,148 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-01-11 21:23:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:48,148 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-01-11 21:23:48,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-01-11 21:23:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:23:48,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:48,151 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:48,152 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:48,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-01-11 21:23:48,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:48,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:48,265 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,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:48,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:48,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:48,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:48,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:48,269 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-01-11 21:23:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:48,905 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-01-11 21:23:48,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:48,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:23:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:48,909 INFO L225 Difference]: With dead ends: 379 [2019-01-11 21:23:48,909 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 21:23:48,911 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:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 21:23:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-01-11 21:23:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 21:23:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-01-11 21:23:48,934 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-01-11 21:23:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:48,934 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-01-11 21:23:48,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-01-11 21:23:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 21:23:48,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:48,938 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:48,938 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:48,939 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2019-01-11 21:23:48,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:48,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:48,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:49,021 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,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:49,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:49,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,023 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-01-11 21:23:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:49,366 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-01-11 21:23:49,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:49,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-11 21:23:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:49,372 INFO L225 Difference]: With dead ends: 444 [2019-01-11 21:23:49,372 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 21:23:49,374 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,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 21:23:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-11 21:23:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 21:23:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-01-11 21:23:49,393 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-01-11 21:23:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:49,393 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-01-11 21:23:49,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-01-11 21:23:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:23:49,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:49,398 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:49,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2019-01-11 21:23:49,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:49,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:49,480 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:49,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:49,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:49,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:49,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,482 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-01-11 21:23:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:49,750 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-01-11 21:23:49,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:49,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:23:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:49,752 INFO L225 Difference]: With dead ends: 492 [2019-01-11 21:23:49,752 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 21:23:49,753 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,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 21:23:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-01-11 21:23:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-11 21:23:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-01-11 21:23:49,771 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-01-11 21:23:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:49,771 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-01-11 21:23:49,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-01-11 21:23:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:23:49,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:49,780 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:49,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2019-01-11 21:23:49,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:49,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:49,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:49,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:49,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:49,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:49,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,916 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-01-11 21:23:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:50,145 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2019-01-11 21:23:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:50,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:23:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:50,149 INFO L225 Difference]: With dead ends: 552 [2019-01-11 21:23:50,149 INFO L226 Difference]: Without dead ends: 303 [2019-01-11 21:23:50,150 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,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-11 21:23:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2019-01-11 21:23:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:23:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-01-11 21:23:50,168 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-01-11 21:23:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:50,169 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-01-11 21:23:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-01-11 21:23:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:23:50,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:50,171 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:50,171 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2019-01-11 21:23:50,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:50,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:50,257 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:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:50,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:50,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:50,259 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-01-11 21:23:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:50,637 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-01-11 21:23:50,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:50,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:50,640 INFO L225 Difference]: With dead ends: 591 [2019-01-11 21:23:50,640 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:23:50,642 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,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:23:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-11 21:23:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:23:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-01-11 21:23:50,662 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-01-11 21:23:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:50,663 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-01-11 21:23:50,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-01-11 21:23:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:23:50,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:50,666 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:50,667 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2019-01-11 21:23:50,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:50,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:50,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:50,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:50,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:50,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:50,769 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-01-11 21:23:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:51,575 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2019-01-11 21:23:51,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:51,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:51,579 INFO L225 Difference]: With dead ends: 594 [2019-01-11 21:23:51,579 INFO L226 Difference]: Without dead ends: 301 [2019-01-11 21:23:51,580 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,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-01-11 21:23:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2019-01-11 21:23:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 21:23:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-01-11 21:23:51,591 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-01-11 21:23:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:51,591 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-01-11 21:23:51,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-01-11 21:23:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:23:51,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:51,593 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:51,593 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:51,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:51,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2019-01-11 21:23:51,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:51,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:51,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:51,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:51,685 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:51,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:51,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:51,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:51,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:51,686 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-01-11 21:23:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:51,994 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-11 21:23:51,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:51,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:23:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:51,999 INFO L225 Difference]: With dead ends: 594 [2019-01-11 21:23:51,999 INFO L226 Difference]: Without dead ends: 305 [2019-01-11 21:23:52,000 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,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-11 21:23:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-01-11 21:23:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-11 21:23:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-01-11 21:23:52,015 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-01-11 21:23:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:52,015 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-01-11 21:23:52,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-01-11 21:23:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 21:23:52,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:52,020 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:52,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:52,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2019-01-11 21:23:52,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:52,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:52,136 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:52,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:52,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:52,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:52,138 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-01-11 21:23:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:53,295 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-01-11 21:23:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:53,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-11 21:23:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:53,303 INFO L225 Difference]: With dead ends: 634 [2019-01-11 21:23:53,303 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 21:23:53,304 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,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 21:23:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-11 21:23:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 21:23:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-01-11 21:23:53,319 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-01-11 21:23:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:53,319 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-01-11 21:23:53,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-01-11 21:23:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:23:53,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:53,323 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,323 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2019-01-11 21:23:53,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:53,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:53,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:53,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:53,424 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,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:53,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:53,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:53,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:53,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:53,426 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-01-11 21:23:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:54,054 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-01-11 21:23:54,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:54,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:23:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:54,058 INFO L225 Difference]: With dead ends: 663 [2019-01-11 21:23:54,058 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 21:23:54,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:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 21:23:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-11 21:23:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 21:23:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-01-11 21:23:54,070 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-01-11 21:23:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:54,071 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-01-11 21:23:54,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-01-11 21:23:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:23:54,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:54,072 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] [2019-01-11 21:23:54,073 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2019-01-11 21:23:54,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:54,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:54,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:54,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:54,160 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,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:54,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:54,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:54,162 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-01-11 21:23:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:54,808 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-01-11 21:23:54,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:54,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:23:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:54,811 INFO L225 Difference]: With dead ends: 696 [2019-01-11 21:23:54,811 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 21:23:54,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:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 21:23:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-11 21:23:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 21:23:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-01-11 21:23:54,823 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-01-11 21:23:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:54,824 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-01-11 21:23:54,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-01-11 21:23:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 21:23:54,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:54,825 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] [2019-01-11 21:23:54,826 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2019-01-11 21:23:54,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:54,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:54,915 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:54,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:54,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:54,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:54,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:54,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:54,919 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-01-11 21:23:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:55,565 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-01-11 21:23:55,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:55,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-11 21:23:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:55,569 INFO L225 Difference]: With dead ends: 723 [2019-01-11 21:23:55,569 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 21:23:55,570 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,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 21:23:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-11 21:23:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 21:23:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-01-11 21:23:55,582 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-01-11 21:23:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:55,583 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-01-11 21:23:55,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-01-11 21:23:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:23:55,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:55,585 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:55,585 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2019-01-11 21:23:55,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:55,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:55,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:55,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:55,667 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-01-11 21:23:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:56,509 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-01-11 21:23:56,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:56,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:23:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:56,512 INFO L225 Difference]: With dead ends: 740 [2019-01-11 21:23:56,512 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 21:23:56,513 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,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 21:23:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-11 21:23:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-11 21:23:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-01-11 21:23:56,529 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-01-11 21:23:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:56,529 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-01-11 21:23:56,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-01-11 21:23:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:23:56,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:56,532 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:56,532 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:56,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2019-01-11 21:23:56,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:56,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:56,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:56,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:56,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:56,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:56,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:56,637 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-01-11 21:23:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:57,094 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-01-11 21:23:57,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:57,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:23:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:57,097 INFO L225 Difference]: With dead ends: 761 [2019-01-11 21:23:57,097 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 21:23:57,098 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,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 21:23:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-11 21:23:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-11 21:23:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-01-11 21:23:57,130 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-01-11 21:23:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:57,131 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-01-11 21:23:57,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-01-11 21:23:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 21:23:57,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:57,133 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:57,133 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2019-01-11 21:23:57,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:57,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-11 21:23:57,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:57,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:57,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:57,224 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-01-11 21:23:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:57,454 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-01-11 21:23:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:57,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-11 21:23:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:57,460 INFO L225 Difference]: With dead ends: 757 [2019-01-11 21:23:57,460 INFO L226 Difference]: Without dead ends: 755 [2019-01-11 21:23:57,460 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:23:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-01-11 21:23:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-01-11 21:23:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-01-11 21:23:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-01-11 21:23:57,484 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-01-11 21:23:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:57,484 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-01-11 21:23:57,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-01-11 21:23:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:57,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:57,488 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:57,488 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2019-01-11 21:23:57,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 21:23:57,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:57,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:57,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:57,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:57,579 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-01-11 21:23:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:57,710 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2019-01-11 21:23:57,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:57,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:23:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:57,717 INFO L225 Difference]: With dead ends: 1831 [2019-01-11 21:23:57,717 INFO L226 Difference]: Without dead ends: 1083 [2019-01-11 21:23:57,719 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:23:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-01-11 21:23:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-01-11 21:23:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-01-11 21:23:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2019-01-11 21:23:57,752 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2019-01-11 21:23:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:57,752 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2019-01-11 21:23:57,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2019-01-11 21:23:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:57,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:57,755 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:57,756 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2019-01-11 21:23:57,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:57,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:57,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:57,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:57,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:57,856 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2019-01-11 21:23:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:58,059 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2019-01-11 21:23:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:58,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:23:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:58,069 INFO L225 Difference]: With dead ends: 2528 [2019-01-11 21:23:58,069 INFO L226 Difference]: Without dead ends: 1452 [2019-01-11 21:23:58,072 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:23:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-01-11 21:23:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2019-01-11 21:23:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-01-11 21:23:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2019-01-11 21:23:58,117 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2019-01-11 21:23:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:58,118 INFO L480 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2019-01-11 21:23:58,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2019-01-11 21:23:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:58,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:58,123 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:58,123 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:58,125 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2019-01-11 21:23:58,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:58,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-11 21:23:58,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:58,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:58,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:58,205 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2019-01-11 21:23:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:58,491 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2019-01-11 21:23:58,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:58,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:23:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:58,501 INFO L225 Difference]: With dead ends: 3248 [2019-01-11 21:23:58,501 INFO L226 Difference]: Without dead ends: 1803 [2019-01-11 21:23:58,505 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,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-01-11 21:23:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-01-11 21:23:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-01-11 21:23:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2019-01-11 21:23:58,563 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2019-01-11 21:23:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:58,563 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2019-01-11 21:23:58,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2019-01-11 21:23:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-11 21:23:58,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:58,571 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:58,571 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2019-01-11 21:23:58,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:58,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 21:23:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:58,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:58,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:58,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:58,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:58,683 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2019-01-11 21:23:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:59,554 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2019-01-11 21:23:59,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:59,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-01-11 21:23:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:59,564 INFO L225 Difference]: With dead ends: 3649 [2019-01-11 21:23:59,564 INFO L226 Difference]: Without dead ends: 1853 [2019-01-11 21:23:59,566 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:23:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-01-11 21:23:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2019-01-11 21:23:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-01-11 21:23:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2019-01-11 21:23:59,616 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2019-01-11 21:23:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:59,616 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2019-01-11 21:23:59,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2019-01-11 21:23:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-11 21:23:59,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:59,623 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:59,623 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2019-01-11 21:23:59,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:59,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:59,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-11 21:23:59,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:59,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:59,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:59,705 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2019-01-11 21:24:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:00,042 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2019-01-11 21:24:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:00,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-01-11 21:24:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:00,049 INFO L225 Difference]: With dead ends: 3666 [2019-01-11 21:24:00,050 INFO L226 Difference]: Without dead ends: 1870 [2019-01-11 21:24:00,052 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:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-01-11 21:24:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2019-01-11 21:24:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-01-11 21:24:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2019-01-11 21:24:00,131 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2019-01-11 21:24:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:00,131 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2019-01-11 21:24:00,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2019-01-11 21:24:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-11 21:24:00,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:00,139 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:00,139 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2019-01-11 21:24:00,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:00,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-11 21:24:00,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:00,336 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:00,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:00,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-11 21:24:00,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:24:00,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:24:00,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:24:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:24:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:24:00,606 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2019-01-11 21:24:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:03,913 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2019-01-11 21:24:03,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:24:03,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-01-11 21:24:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:03,927 INFO L225 Difference]: With dead ends: 4264 [2019-01-11 21:24:03,927 INFO L226 Difference]: Without dead ends: 2435 [2019-01-11 21:24:03,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-01-11 21:24:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2019-01-11 21:24:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-01-11 21:24:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2019-01-11 21:24:03,993 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2019-01-11 21:24:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:03,994 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2019-01-11 21:24:03,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:24:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2019-01-11 21:24:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-11 21:24:04,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:04,003 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:04,004 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2019-01-11 21:24:04,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:04,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:04,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:04,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-01-11 21:24:04,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:04,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:04,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:04,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:04,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:04,132 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2019-01-11 21:24:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:04,857 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2019-01-11 21:24:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:04,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-01-11 21:24:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:04,869 INFO L225 Difference]: With dead ends: 3394 [2019-01-11 21:24:04,869 INFO L226 Difference]: Without dead ends: 1678 [2019-01-11 21:24:04,872 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,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-01-11 21:24:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2019-01-11 21:24:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-01-11 21:24:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2019-01-11 21:24:04,924 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2019-01-11 21:24:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:04,925 INFO L480 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2019-01-11 21:24:04,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2019-01-11 21:24:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-11 21:24:04,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:04,933 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:04,933 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2019-01-11 21:24:04,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:04,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:04,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-11 21:24:05,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:05,156 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:05,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:05,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-11 21:24:05,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:24:05,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:24:05,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:24:05,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:24:05,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:24:05,326 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2019-01-11 21:24:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:06,002 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2019-01-11 21:24:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:24:06,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-01-11 21:24:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:06,019 INFO L225 Difference]: With dead ends: 5319 [2019-01-11 21:24:06,019 INFO L226 Difference]: Without dead ends: 3648 [2019-01-11 21:24:06,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-01-11 21:24:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2019-01-11 21:24:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-01-11 21:24:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2019-01-11 21:24:06,099 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2019-01-11 21:24:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:06,100 INFO L480 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2019-01-11 21:24:06,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:24:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2019-01-11 21:24:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-11 21:24:06,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:06,107 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:06,108 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2019-01-11 21:24:06,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:06,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:06,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-11 21:24:06,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:06,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:06,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:06,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:06,235 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2019-01-11 21:24:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:06,459 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2019-01-11 21:24:06,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:06,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-01-11 21:24:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:06,480 INFO L225 Difference]: With dead ends: 5741 [2019-01-11 21:24:06,480 INFO L226 Difference]: Without dead ends: 3745 [2019-01-11 21:24:06,484 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:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-01-11 21:24:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2019-01-11 21:24:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-01-11 21:24:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2019-01-11 21:24:06,604 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2019-01-11 21:24:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:06,604 INFO L480 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2019-01-11 21:24:06,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2019-01-11 21:24:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-11 21:24:06,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:06,613 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:06,613 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2019-01-11 21:24:06,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:06,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:06,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-01-11 21:24:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:06,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:06,776 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2019-01-11 21:24:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:07,139 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2019-01-11 21:24:07,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:07,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-01-11 21:24:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:07,157 INFO L225 Difference]: With dead ends: 7697 [2019-01-11 21:24:07,157 INFO L226 Difference]: Without dead ends: 3961 [2019-01-11 21:24:07,162 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:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-01-11 21:24:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2019-01-11 21:24:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-01-11 21:24:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2019-01-11 21:24:07,273 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2019-01-11 21:24:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:07,273 INFO L480 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2019-01-11 21:24:07,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2019-01-11 21:24:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-11 21:24:07,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:07,279 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:07,279 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:07,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2019-01-11 21:24:07,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:07,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:07,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:07,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-01-11 21:24:07,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:07,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:07,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:07,390 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2019-01-11 21:24:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:07,717 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2019-01-11 21:24:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:07,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-01-11 21:24:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:07,724 INFO L225 Difference]: With dead ends: 7611 [2019-01-11 21:24:07,725 INFO L226 Difference]: Without dead ends: 3875 [2019-01-11 21:24:07,729 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:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-01-11 21:24:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2019-01-11 21:24:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2019-01-11 21:24:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2019-01-11 21:24:07,829 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2019-01-11 21:24:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:07,829 INFO L480 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2019-01-11 21:24:07,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2019-01-11 21:24:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-11 21:24:07,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:07,834 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:07,834 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2019-01-11 21:24:07,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:07,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:07,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:07,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-01-11 21:24:07,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:07,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:07,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:07,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:07,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:07,955 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2019-01-11 21:24:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:08,212 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2019-01-11 21:24:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:08,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-01-11 21:24:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:08,220 INFO L225 Difference]: With dead ends: 8043 [2019-01-11 21:24:08,221 INFO L226 Difference]: Without dead ends: 4215 [2019-01-11 21:24:08,224 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:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2019-01-11 21:24:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2019-01-11 21:24:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-01-11 21:24:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2019-01-11 21:24:08,365 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2019-01-11 21:24:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:08,367 INFO L480 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2019-01-11 21:24:08,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2019-01-11 21:24:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-11 21:24:08,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:08,374 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:08,374 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2019-01-11 21:24:08,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:08,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:08,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-01-11 21:24:08,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:08,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:08,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,513 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2019-01-11 21:24:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:09,183 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2019-01-11 21:24:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:09,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-01-11 21:24:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:09,188 INFO L225 Difference]: With dead ends: 6854 [2019-01-11 21:24:09,188 INFO L226 Difference]: Without dead ends: 2132 [2019-01-11 21:24:09,194 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:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-01-11 21:24:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2019-01-11 21:24:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-01-11 21:24:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2019-01-11 21:24:09,266 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2019-01-11 21:24:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:09,267 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2019-01-11 21:24:09,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2019-01-11 21:24:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-11 21:24:09,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:09,275 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:09,275 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2019-01-11 21:24:09,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:09,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-01-11 21:24:09,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:09,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:09,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:09,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:09,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:09,428 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2019-01-11 21:24:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:09,689 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2019-01-11 21:24:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:09,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-01-11 21:24:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:09,694 INFO L225 Difference]: With dead ends: 4297 [2019-01-11 21:24:09,695 INFO L226 Difference]: Without dead ends: 2172 [2019-01-11 21:24:09,698 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:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-01-11 21:24:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2019-01-11 21:24:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-01-11 21:24:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2019-01-11 21:24:09,767 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2019-01-11 21:24:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:09,767 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2019-01-11 21:24:09,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2019-01-11 21:24:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-01-11 21:24:09,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:09,775 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:09,775 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2019-01-11 21:24:09,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:09,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-01-11 21:24:09,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:09,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:09,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:09,996 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2019-01-11 21:24:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:10,892 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2019-01-11 21:24:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:10,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-01-11 21:24:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:10,896 INFO L225 Difference]: With dead ends: 4267 [2019-01-11 21:24:10,896 INFO L226 Difference]: Without dead ends: 2142 [2019-01-11 21:24:10,899 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,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-01-11 21:24:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2019-01-11 21:24:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-01-11 21:24:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2019-01-11 21:24:10,962 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2019-01-11 21:24:10,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:10,963 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2019-01-11 21:24:10,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2019-01-11 21:24:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-11 21:24:10,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:10,968 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:10,970 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2019-01-11 21:24:10,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:10,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-11 21:24:11,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:11,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:24:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:11,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-01-11 21:24:11,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:11,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:11,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:11,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:11,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:11,840 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 5 states. [2019-01-11 21:24:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:13,797 INFO L93 Difference]: Finished difference Result 5817 states and 7440 transitions. [2019-01-11 21:24:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:24:13,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-01-11 21:24:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:13,803 INFO L225 Difference]: With dead ends: 5817 [2019-01-11 21:24:13,803 INFO L226 Difference]: Without dead ends: 3638 [2019-01-11 21:24:13,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 396 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:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2019-01-11 21:24:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 2156. [2019-01-11 21:24:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-01-11 21:24:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2019-01-11 21:24:13,928 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 392 [2019-01-11 21:24:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:13,928 INFO L480 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2019-01-11 21:24:13,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2019-01-11 21:24:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-01-11 21:24:13,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:13,940 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:13,941 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:13,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2019-01-11 21:24:13,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:13,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:13,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:13,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-01-11 21:24:14,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:14,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:14,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:14,207 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2019-01-11 21:24:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:15,448 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2019-01-11 21:24:15,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:15,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-01-11 21:24:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:15,451 INFO L225 Difference]: With dead ends: 4485 [2019-01-11 21:24:15,451 INFO L226 Difference]: Without dead ends: 2336 [2019-01-11 21:24:15,453 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:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-01-11 21:24:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2019-01-11 21:24:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-11 21:24:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2019-01-11 21:24:15,532 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2019-01-11 21:24:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:15,533 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2019-01-11 21:24:15,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2019-01-11 21:24:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-01-11 21:24:15,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:15,541 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, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:15,542 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2019-01-11 21:24:15,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:15,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-01-11 21:24:15,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:15,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:15,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:15,806 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2019-01-11 21:24:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:16,845 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2019-01-11 21:24:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:16,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2019-01-11 21:24:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:16,848 INFO L225 Difference]: With dead ends: 4640 [2019-01-11 21:24:16,848 INFO L226 Difference]: Without dead ends: 2321 [2019-01-11 21:24:16,850 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:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-01-11 21:24:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2019-01-11 21:24:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-01-11 21:24:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2019-01-11 21:24:16,911 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2019-01-11 21:24:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:16,912 INFO L480 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2019-01-11 21:24:16,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2019-01-11 21:24:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-01-11 21:24:16,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:16,919 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:16,919 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2019-01-11 21:24:16,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:16,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:16,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:16,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:24:17,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:17,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:24:17,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:17,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:24:17,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:24:17,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:24:17,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:24:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:24:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:24:17,819 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2019-01-11 21:24:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:18,704 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2019-01-11 21:24:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:24:18,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2019-01-11 21:24:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:18,705 INFO L225 Difference]: With dead ends: 3916 [2019-01-11 21:24:18,705 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:24:18,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:24:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:24:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:24:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:24:18,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2019-01-11 21:24:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:18,710 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:24:18,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:24:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:24:18,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:24:18,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:24:18,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:18,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:18,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:18,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:18,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:18,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:18,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:18,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,083 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2019-01-11 21:24:19,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:19,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,294 WARN L181 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 201 [2019-01-11 21:24:20,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:20,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,030 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 201 [2019-01-11 21:24:21,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:21,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:24,330 WARN L181 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-01-11 21:24:25,702 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2019-01-11 21:24:27,228 WARN L181 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-11 21:24:27,848 WARN L181 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-11 21:24:28,346 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-11 21:24:28,699 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2019-01-11 21:24:28,906 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2019-01-11 21:24:29,307 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-01-11 21:24:29,459 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 19 [2019-01-11 21:24:29,897 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-11 21:24:30,157 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-01-11 21:24:30,462 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-01-11 21:24:30,823 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 25 [2019-01-11 21:24:33,369 WARN L181 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2019-01-11 21:24:34,466 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-01-11 21:24:34,855 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-01-11 21:24:37,456 WARN L181 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2019-01-11 21:24:37,723 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-01-11 21:24:38,118 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-11 21:24:38,413 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-01-11 21:24:38,675 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 546) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 557) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 568) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 579) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-01-11 21:24:38,679 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-01-11 21:24:38,680 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 547) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse2 .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (and .cse2 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-01-11 21:24:38,680 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 579) the Hoare annotation is: false [2019-01-11 21:24:38,680 INFO L451 ceAbstractionStarter]: At program point L599(lines 98 600) the Hoare annotation is: true [2019-01-11 21:24:38,680 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2019-01-11 21:24:38,680 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 545) no Hoare annotation was computed. [2019-01-11 21:24:38,680 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 556) no Hoare annotation was computed. [2019-01-11 21:24:38,680 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 567) no Hoare annotation was computed. [2019-01-11 21:24:38,680 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 578) no Hoare annotation was computed. [2019-01-11 21:24:38,681 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-01-11 21:24:38,681 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-01-11 21:24:38,681 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:38,682 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 557) 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 (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-11 21:24:38,682 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 568) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 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))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (and .cse9 .cse0 .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7))) [2019-01-11 21:24:38,682 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-01-11 21:24:38,682 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-01-11 21:24:38,682 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:38,683 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 555) no Hoare annotation was computed. [2019-01-11 21:24:38,683 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 566) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 577) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 606) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 542) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-11 21:24:38,684 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 554) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 565) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 576) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-11 21:24:38,685 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 578) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2) (and .cse0 (and .cse2 (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1))) (and .cse0 (and .cse2 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-11 21:24:38,686 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 555) 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 (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-11 21:24:38,686 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 566) 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 (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-11 21:24:38,686 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-01-11 21:24:38,686 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-01-11 21:24:38,686 INFO L451 ceAbstractionStarter]: At program point L609(lines 11 611) the Hoare annotation is: true [2019-01-11 21:24:38,686 INFO L444 ceAbstractionStarter]: At program point L543(lines 99 598) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse31 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse30 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse16 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse32 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse27 (and .cse7 (and .cse15 .cse30 .cse5 .cse16 .cse17 .cse18 .cse19 .cse29 .cse32 .cse20))) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse25 (and .cse15 .cse30 .cse16 .cse22 .cse17 .cse18 .cse19 .cse31 .cse29 .cse32 .cse20)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (and .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse31 .cse2 .cse29 .cse32 .cse20)) (.cse26 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse4) (and .cse5 .cse10) (and .cse10 .cse8) (and .cse0 .cse11 .cse12 .cse4) (and .cse13 .cse5 .cse14) (and .cse15 .cse7 .cse5 .cse16 .cse17 .cse18 .cse19 .cse14 .cse20) (and .cse11 .cse7 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9) (and .cse21 .cse22) (and .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse22 .cse3) (and .cse22 .cse23) (and .cse24 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 .cse14 .cse25) (and .cse0 .cse1 .cse13 .cse2 .cse3) (and .cse10 .cse2) (and .cse23 .cse6 .cse2) (and .cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse6) (and .cse26 .cse27) (and .cse13 .cse24 .cse28 .cse6) (and .cse5 .cse29 .cse3) (and .cse21 .cse6 .cse2) (and .cse27 .cse28) (and .cse28 .cse25) (and (and .cse8 .cse29 .cse3) .cse4) (and .cse26 .cse25) (and .cse10 .cse22) (and .cse0 .cse11 .cse12 .cse13) (and .cse13 .cse2 .cse14 .cse6) (and .cse13 .cse24 .cse26 .cse6)))) [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 553) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 564) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 575) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 482) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 515) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 552) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 563) no Hoare annotation was computed. [2019-01-11 21:24:38,687 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:38,688 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 574) no Hoare annotation was computed. [2019-01-11 21:24:38,688 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 596) no Hoare annotation was computed. [2019-01-11 21:24:38,688 INFO L444 ceAbstractionStarter]: At program point L514(lines 72 610) the Hoare annotation is: false [2019-01-11 21:24:38,688 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 553) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2019-01-11 21:24:38,688 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 564) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.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 (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 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)))) (or (and (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse10 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-11 21:24:38,688 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-11 21:24:38,688 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:38,688 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 595) no Hoare annotation was computed. [2019-01-11 21:24:38,688 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-01-11 21:24:38,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:24:38,689 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2019-01-11 21:24:38,691 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-01-11 21:24:38,691 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2019-01-11 21:24:38,692 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.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 (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 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)))) (or (and (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse10 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-11 21:24:38,692 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 551) no Hoare annotation was computed. [2019-01-11 21:24:38,692 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 562) no Hoare annotation was computed. [2019-01-11 21:24:38,692 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 573) no Hoare annotation was computed. [2019-01-11 21:24:38,692 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-01-11 21:24:38,692 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 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))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2019-01-11 21:24:38,692 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 574) 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 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9))) [2019-01-11 21:24:38,692 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2019-01-11 21:24:38,692 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 542) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 542) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 550) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 561) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 572) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 610) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-01-11 21:24:38,693 INFO L448 ceAbstractionStarter]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2019-01-11 21:24:38,694 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-01-11 21:24:38,694 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:24:38,694 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5))) [2019-01-11 21:24:38,694 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 562) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 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))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2019-01-11 21:24:38,694 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 572) 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 (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-11 21:24:38,694 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-11 21:24:38,694 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 491) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L451 ceAbstractionStarter]: At program point L621(lines 612 623) the Hoare annotation is: true [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 549) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 560) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 571) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 542) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:24:38,695 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 548) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 559) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 570) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 499) no Hoare annotation was computed. [2019-01-11 21:24:38,696 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse3) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:38,696 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 560) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8) (and (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-11 21:24:38,696 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-01-11 21:24:38,697 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-01-11 21:24:38,697 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 547) no Hoare annotation was computed. [2019-01-11 21:24:38,697 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 558) no Hoare annotation was computed. [2019-01-11 21:24:38,697 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 569) no Hoare annotation was computed. [2019-01-11 21:24:38,697 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 598) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse31 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse30 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse16 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse32 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse27 (and .cse7 (and .cse15 .cse30 .cse5 .cse16 .cse17 .cse18 .cse19 .cse29 .cse32 .cse20))) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse25 (and .cse15 .cse30 .cse16 .cse22 .cse17 .cse18 .cse19 .cse31 .cse29 .cse32 .cse20)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (and .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse31 .cse2 .cse29 .cse32 .cse20)) (.cse26 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse4) (and .cse5 .cse10) (and .cse10 .cse8) (and .cse0 .cse11 .cse12 .cse4) (and .cse13 .cse5 .cse14) (and .cse15 .cse7 .cse5 .cse16 .cse17 .cse18 .cse19 .cse14 .cse20) (and .cse11 .cse7 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9) (and .cse21 .cse22) (and .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse22 .cse3) (and .cse22 .cse23) (and .cse24 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 .cse14 .cse25) (and .cse0 .cse1 .cse13 .cse2 .cse3) (and .cse10 .cse2) (and .cse23 .cse6 .cse2) (and .cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse6) (and .cse26 .cse27) (and .cse13 .cse24 .cse28 .cse6) (and .cse5 .cse29 .cse3) (and .cse21 .cse6 .cse2) (and .cse27 .cse28) (and .cse28 .cse25) (and (and .cse8 .cse29 .cse3) .cse4) (and .cse26 .cse25) (and .cse10 .cse22) (and .cse0 .cse11 .cse12 .cse13) (and .cse13 .cse2 .cse14 .cse6) (and .cse13 .cse24 .cse26 .cse6)))) [2019-01-11 21:24:38,697 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-01-11 21:24:38,697 INFO L448 ceAbstractionStarter]: For program point L496-2(lines 208 542) no Hoare annotation was computed. [2019-01-11 21:24:38,698 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 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))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2019-01-11 21:24:38,698 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-11 21:24:38,698 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 558) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse1) (and .cse0 .cse3 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1))) [2019-01-11 21:24:38,698 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10))) [2019-01-11 21:24:38,698 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:24:38,698 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2019-01-11 21:24:38,698 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2019-01-11 21:24:38,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:24:38 BoogieIcfgContainer [2019-01-11 21:24:38,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:24:38,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:24:38,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:24:38,796 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:24:38,797 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:46" (3/4) ... [2019-01-11 21:24:38,803 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:24:38,828 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:24:38,830 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:24:38,982 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:24:38,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:24:38,983 INFO L168 Benchmark]: Toolchain (without parser) took 54201.20 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 812.1 MB). Free memory was 950.0 MB in the beginning and 1.7 GB in the end (delta: -799.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:38,985 INFO L168 Benchmark]: CDTParser took 0.17 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:38,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.07 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 932.5 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:38,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:38,986 INFO L168 Benchmark]: Boogie Preprocessor took 40.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:38,987 INFO L168 Benchmark]: RCFGBuilder took 1434.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:38,990 INFO L168 Benchmark]: TraceAbstraction took 51927.44 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 703.1 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -732.6 MB). Peak memory consumption was 952.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:38,990 INFO L168 Benchmark]: Witness Printer took 186.69 ms. Allocated memory is still 1.8 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:38,994 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.17 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 472.07 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 932.5 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1434.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51927.44 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 703.1 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -732.6 MB). Peak memory consumption was 952.3 MB. Max. memory is 11.5 GB. * Witness Printer took 186.69 ms. Allocated memory is still 1.8 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: 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) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0)) || (((8448 <= s__state && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((8448 <= s__state && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((8448 <= s__state && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && s__state <= 8448) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__hit == 0)) || (((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && !(8672 == s__state)) && !(8656 == s__state)) && 8640 <= s__state)) || (((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && !(8672 == s__state)) && !(8656 == s__state)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 == s__state)) && blastFlag == 2) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && !(8656 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && !(12292 == s__state)) && blastFlag == 1) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && !(s__hit == 0))) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((s__state <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state == 8608) || (((0 == s__hit && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && s__state <= 8448) || (s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448 && blastFlag == 1 && !(8448 == s__state))) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448 && !(8448 == s__state) && blastFlag == 2) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) || ((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (blastFlag == 1 && s__state <= 3)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((((((((!(8497 == s__state) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag == 0)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || (blastFlag == 0 && s__state == 8560)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && s__state == 8512)) || ((8448 <= s__state && s__state <= 8576) && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || ((((s__state <= 8672 && !(8657 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state)) || (s__state <= 3 && blastFlag == 2)) || ((s__state == 8560 && 0 == s__hit) && blastFlag == 2)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8528) && 0 == s__hit)) || (s__state == 8592 && 8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608) && 0 == s__hit)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__state == 8544 && 0 == s__hit) && blastFlag == 2)) || ((8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608)) || (s__state == 8608 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (s__state == 8592 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (s__state <= 3 && blastFlag == 0)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8592) && 0 == s__hit) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((s__state <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(8481 == s__state) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || ((((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && s__state <= 8576) && ((((((!(8481 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit)) || ((((((((((8448 <= s__state && !(8481 == s__state)) && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) || ((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (blastFlag == 1 && s__state <= 3)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((((((((!(8497 == s__state) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag == 0)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || (blastFlag == 0 && s__state == 8560)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && s__state == 8512)) || ((8448 <= s__state && s__state <= 8576) && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || ((((s__state <= 8672 && !(8657 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state)) || (s__state <= 3 && blastFlag == 2)) || ((s__state == 8560 && 0 == s__hit) && blastFlag == 2)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8528) && 0 == s__hit)) || (s__state == 8592 && 8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608) && 0 == s__hit)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__state == 8544 && 0 == s__hit) && blastFlag == 2)) || ((8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608)) || (s__state == 8608 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (s__state == 8592 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (s__state <= 3 && blastFlag == 0)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8592) && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state) || ((((s__state <= 8672 && blastFlag == 1) && !(8672 == s__state)) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && !(8672 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || ((((s__state <= 8672 && !(8672 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. SAFE Result, 51.7s OverallTime, 34 OverallIterations, 19 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 19.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 6488 SDtfs, 4148 SDslu, 3265 SDs, 0 SdLazy, 3730 SolverSat, 959 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1574 GetRequests, 1528 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 4578 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3659 HoareAnnotationTreeSize, 28 FomulaSimplifications, 121494 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 32552 FormulaSimplificationTreeSizeReductionInter, 17.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 8393 NumberOfCodeBlocks, 8393 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 8355 ConstructedInterpolants, 0 QuantifiedInterpolants, 3514509 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2325 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 38 InterpolantComputations, 31 PerfectInterpolantSequences, 27180/27342 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...