./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer --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 49452e318e3c9c4b1e038ab7778998d33b04e5b2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:41:09,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:41:09,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:41:09,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:41:09,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:41:09,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:41:09,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:41:09,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:41:09,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:41:09,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:41:09,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:41:09,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:41:09,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:41:09,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:41:09,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:41:09,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:41:09,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:41:09,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:41:09,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:41:09,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:41:09,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:41:09,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:41:09,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:41:09,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:41:09,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:41:09,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:41:09,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:41:09,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:41:09,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:41:09,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:41:09,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:41:09,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:41:09,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:41:09,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:41:09,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:41:09,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:41:09,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:41:09,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:41:09,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:41:09,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:41:09,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:41:09,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:41:09,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:41:09,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:41:09,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:41:09,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:41:09,931 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:41:09,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:41:09,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:41:09,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:41:09,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:41:09,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:41:09,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:41:09,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:41:09,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:41:09,934 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:41:09,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:41:09,934 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:41:09,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:41:09,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:41:09,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:41:09,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:41:09,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:41:09,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:41:09,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:41:09,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:41:09,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:41:09,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:41:09,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:41:09,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:41:09,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer 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 -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-11-20 01:41:10,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:41:10,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:41:10,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:41:10,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:41:10,160 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:41:10,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-20 01:41:10,232 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/data/ffc8db8f1/40951463006d43a8b78cd127d8fd3435/FLAG54acf132d [2019-11-20 01:41:10,722 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:41:10,723 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-20 01:41:10,741 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/data/ffc8db8f1/40951463006d43a8b78cd127d8fd3435/FLAG54acf132d [2019-11-20 01:41:11,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/data/ffc8db8f1/40951463006d43a8b78cd127d8fd3435 [2019-11-20 01:41:11,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:41:11,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:41:11,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:41:11,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:41:11,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:41:11,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e29d2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11, skipping insertion in model container [2019-11-20 01:41:11,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:41:11,155 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:41:11,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:41:11,553 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:41:11,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:41:11,635 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:41:11,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11 WrapperNode [2019-11-20 01:41:11,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:41:11,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:41:11,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:41:11,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:41:11,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:41:11,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:41:11,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:41:11,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:41:11,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... [2019-11-20 01:41:11,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:41:11,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:41:11,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:41:11,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:41:11,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:41:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:41:11,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:41:11,989 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 01:41:12,627 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 01:41:12,629 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 01:41:12,630 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:41:12,631 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:41:12,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:41:12 BoogieIcfgContainer [2019-11-20 01:41:12,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:41:12,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:41:12,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:41:12,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:41:12,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:41:11" (1/3) ... [2019-11-20 01:41:12,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15dac795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:41:12, skipping insertion in model container [2019-11-20 01:41:12,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:41:11" (2/3) ... [2019-11-20 01:41:12,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15dac795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:41:12, skipping insertion in model container [2019-11-20 01:41:12,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:41:12" (3/3) ... [2019-11-20 01:41:12,644 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-20 01:41:12,657 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:41:12,664 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:41:12,673 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:41:12,693 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:41:12,694 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:41:12,694 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:41:12,694 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:41:12,694 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:41:12,694 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:41:12,694 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:41:12,695 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:41:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-11-20 01:41:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 01:41:12,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:12,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:12,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash -91611738, now seen corresponding path program 1 times [2019-11-20 01:41:12,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:12,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349927606] [2019-11-20 01:41:12,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:41:12,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349927606] [2019-11-20 01:41:12,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:12,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:12,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094020631] [2019-11-20 01:41:12,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:12,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:13,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:13,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:13,007 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-11-20 01:41:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:13,314 INFO L93 Difference]: Finished difference Result 327 states and 564 transitions. [2019-11-20 01:41:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:13,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 01:41:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:13,327 INFO L225 Difference]: With dead ends: 327 [2019-11-20 01:41:13,328 INFO L226 Difference]: Without dead ends: 173 [2019-11-20 01:41:13,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-20 01:41:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2019-11-20 01:41:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-20 01:41:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 273 transitions. [2019-11-20 01:41:13,386 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 273 transitions. Word has length 43 [2019-11-20 01:41:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:13,387 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 273 transitions. [2019-11-20 01:41:13,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 273 transitions. [2019-11-20 01:41:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 01:41:13,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:13,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:13,390 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1448027309, now seen corresponding path program 1 times [2019-11-20 01:41:13,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:13,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928868629] [2019-11-20 01:41:13,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:41:13,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928868629] [2019-11-20 01:41:13,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:13,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:13,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660598584] [2019-11-20 01:41:13,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:13,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:13,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:13,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:13,461 INFO L87 Difference]: Start difference. First operand 167 states and 273 transitions. Second operand 3 states. [2019-11-20 01:41:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:13,712 INFO L93 Difference]: Finished difference Result 376 states and 623 transitions. [2019-11-20 01:41:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:13,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 01:41:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:13,716 INFO L225 Difference]: With dead ends: 376 [2019-11-20 01:41:13,716 INFO L226 Difference]: Without dead ends: 214 [2019-11-20 01:41:13,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-20 01:41:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2019-11-20 01:41:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-20 01:41:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 350 transitions. [2019-11-20 01:41:13,747 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 350 transitions. Word has length 44 [2019-11-20 01:41:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:13,748 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 350 transitions. [2019-11-20 01:41:13,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 350 transitions. [2019-11-20 01:41:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 01:41:13,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:13,758 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:13,759 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:13,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1909160843, now seen corresponding path program 1 times [2019-11-20 01:41:13,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:13,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134247209] [2019-11-20 01:41:13,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:41:13,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134247209] [2019-11-20 01:41:13,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:13,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:13,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083432567] [2019-11-20 01:41:13,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:13,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:13,881 INFO L87 Difference]: Start difference. First operand 208 states and 350 transitions. Second operand 3 states. [2019-11-20 01:41:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:14,124 INFO L93 Difference]: Finished difference Result 440 states and 747 transitions. [2019-11-20 01:41:14,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:14,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 01:41:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:14,128 INFO L225 Difference]: With dead ends: 440 [2019-11-20 01:41:14,128 INFO L226 Difference]: Without dead ends: 239 [2019-11-20 01:41:14,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-20 01:41:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-11-20 01:41:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-20 01:41:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 406 transitions. [2019-11-20 01:41:14,160 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 406 transitions. Word has length 72 [2019-11-20 01:41:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:14,163 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 406 transitions. [2019-11-20 01:41:14,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 406 transitions. [2019-11-20 01:41:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 01:41:14,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:14,166 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:14,166 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1091248829, now seen corresponding path program 1 times [2019-11-20 01:41:14,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:14,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430840818] [2019-11-20 01:41:14,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:41:14,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430840818] [2019-11-20 01:41:14,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:14,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:14,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173649328] [2019-11-20 01:41:14,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:14,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:14,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:14,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:14,244 INFO L87 Difference]: Start difference. First operand 239 states and 406 transitions. Second operand 3 states. [2019-11-20 01:41:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:14,473 INFO L93 Difference]: Finished difference Result 517 states and 883 transitions. [2019-11-20 01:41:14,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:14,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 01:41:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:14,476 INFO L225 Difference]: With dead ends: 517 [2019-11-20 01:41:14,476 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 01:41:14,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 01:41:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-11-20 01:41:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-20 01:41:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 481 transitions. [2019-11-20 01:41:14,499 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 481 transitions. Word has length 83 [2019-11-20 01:41:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:14,499 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 481 transitions. [2019-11-20 01:41:14,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 481 transitions. [2019-11-20 01:41:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 01:41:14,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:14,503 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:14,505 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 448380383, now seen corresponding path program 1 times [2019-11-20 01:41:14,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:14,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366307972] [2019-11-20 01:41:14,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 01:41:14,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366307972] [2019-11-20 01:41:14,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:14,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:14,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020913509] [2019-11-20 01:41:14,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:14,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:14,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:14,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:14,594 INFO L87 Difference]: Start difference. First operand 281 states and 481 transitions. Second operand 3 states. [2019-11-20 01:41:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:14,758 INFO L93 Difference]: Finished difference Result 572 states and 979 transitions. [2019-11-20 01:41:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:14,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 01:41:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:14,761 INFO L225 Difference]: With dead ends: 572 [2019-11-20 01:41:14,761 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 01:41:14,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 01:41:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-11-20 01:41:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-20 01:41:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 503 transitions. [2019-11-20 01:41:14,789 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 503 transitions. Word has length 84 [2019-11-20 01:41:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:14,790 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 503 transitions. [2019-11-20 01:41:14,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 503 transitions. [2019-11-20 01:41:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 01:41:14,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:14,794 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:14,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash 429685604, now seen corresponding path program 1 times [2019-11-20 01:41:14,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:14,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905552935] [2019-11-20 01:41:14,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:41:14,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905552935] [2019-11-20 01:41:14,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:14,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:14,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953553176] [2019-11-20 01:41:14,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:14,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:14,908 INFO L87 Difference]: Start difference. First operand 296 states and 503 transitions. Second operand 3 states. [2019-11-20 01:41:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:15,152 INFO L93 Difference]: Finished difference Result 589 states and 1000 transitions. [2019-11-20 01:41:15,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:15,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 01:41:15,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:15,155 INFO L225 Difference]: With dead ends: 589 [2019-11-20 01:41:15,155 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 01:41:15,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 01:41:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-20 01:41:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-20 01:41:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-11-20 01:41:15,168 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-11-20 01:41:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:15,169 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-11-20 01:41:15,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-11-20 01:41:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 01:41:15,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:15,171 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:15,171 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash -52731309, now seen corresponding path program 1 times [2019-11-20 01:41:15,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:15,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404481208] [2019-11-20 01:41:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 01:41:15,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404481208] [2019-11-20 01:41:15,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:15,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:15,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202564527] [2019-11-20 01:41:15,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:15,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,223 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 3 states. [2019-11-20 01:41:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:15,354 INFO L93 Difference]: Finished difference Result 583 states and 987 transitions. [2019-11-20 01:41:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:15,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-20 01:41:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:15,356 INFO L225 Difference]: With dead ends: 583 [2019-11-20 01:41:15,356 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 01:41:15,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 01:41:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-20 01:41:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-20 01:41:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 494 transitions. [2019-11-20 01:41:15,368 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 494 transitions. Word has length 85 [2019-11-20 01:41:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:15,368 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 494 transitions. [2019-11-20 01:41:15,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 494 transitions. [2019-11-20 01:41:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:41:15,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:15,370 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:15,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:15,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash -825774373, now seen corresponding path program 1 times [2019-11-20 01:41:15,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:15,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102911001] [2019-11-20 01:41:15,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 01:41:15,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102911001] [2019-11-20 01:41:15,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:15,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:15,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330153384] [2019-11-20 01:41:15,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:15,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,443 INFO L87 Difference]: Start difference. First operand 294 states and 494 transitions. Second operand 3 states. [2019-11-20 01:41:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:15,569 INFO L93 Difference]: Finished difference Result 589 states and 988 transitions. [2019-11-20 01:41:15,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:15,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 01:41:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:15,571 INFO L225 Difference]: With dead ends: 589 [2019-11-20 01:41:15,571 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 01:41:15,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 01:41:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-11-20 01:41:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-20 01:41:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 499 transitions. [2019-11-20 01:41:15,585 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 499 transitions. Word has length 97 [2019-11-20 01:41:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:15,585 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 499 transitions. [2019-11-20 01:41:15,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 499 transitions. [2019-11-20 01:41:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 01:41:15,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:15,587 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:15,587 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1871019140, now seen corresponding path program 1 times [2019-11-20 01:41:15,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:15,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961161320] [2019-11-20 01:41:15,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 01:41:15,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961161320] [2019-11-20 01:41:15,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:15,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:15,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491603471] [2019-11-20 01:41:15,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:15,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:15,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:15,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,659 INFO L87 Difference]: Start difference. First operand 302 states and 499 transitions. Second operand 3 states. [2019-11-20 01:41:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:15,827 INFO L93 Difference]: Finished difference Result 628 states and 1040 transitions. [2019-11-20 01:41:15,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:15,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 01:41:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:15,830 INFO L225 Difference]: With dead ends: 628 [2019-11-20 01:41:15,830 INFO L226 Difference]: Without dead ends: 333 [2019-11-20 01:41:15,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-20 01:41:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-11-20 01:41:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-20 01:41:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 546 transitions. [2019-11-20 01:41:15,844 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 546 transitions. Word has length 98 [2019-11-20 01:41:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:15,844 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 546 transitions. [2019-11-20 01:41:15,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 546 transitions. [2019-11-20 01:41:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:41:15,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:15,846 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:15,846 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:15,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1449457736, now seen corresponding path program 1 times [2019-11-20 01:41:15,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:15,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870488266] [2019-11-20 01:41:15,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 01:41:15,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870488266] [2019-11-20 01:41:15,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:15,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:15,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693885976] [2019-11-20 01:41:15,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:15,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:15,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:15,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:15,888 INFO L87 Difference]: Start difference. First operand 331 states and 546 transitions. Second operand 3 states. [2019-11-20 01:41:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:16,033 INFO L93 Difference]: Finished difference Result 689 states and 1140 transitions. [2019-11-20 01:41:16,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:16,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 01:41:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:16,036 INFO L225 Difference]: With dead ends: 689 [2019-11-20 01:41:16,036 INFO L226 Difference]: Without dead ends: 365 [2019-11-20 01:41:16,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-20 01:41:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-20 01:41:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-20 01:41:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 588 transitions. [2019-11-20 01:41:16,059 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 588 transitions. Word has length 99 [2019-11-20 01:41:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:16,060 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 588 transitions. [2019-11-20 01:41:16,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 588 transitions. [2019-11-20 01:41:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:41:16,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:16,062 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:16,062 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:16,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1215142768, now seen corresponding path program 1 times [2019-11-20 01:41:16,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:16,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571068256] [2019-11-20 01:41:16,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 01:41:16,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571068256] [2019-11-20 01:41:16,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:16,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:16,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409038896] [2019-11-20 01:41:16,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:16,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,115 INFO L87 Difference]: Start difference. First operand 358 states and 588 transitions. Second operand 3 states. [2019-11-20 01:41:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:16,277 INFO L93 Difference]: Finished difference Result 711 states and 1167 transitions. [2019-11-20 01:41:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:16,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 01:41:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:16,280 INFO L225 Difference]: With dead ends: 711 [2019-11-20 01:41:16,280 INFO L226 Difference]: Without dead ends: 360 [2019-11-20 01:41:16,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-20 01:41:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2019-11-20 01:41:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-20 01:41:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 584 transitions. [2019-11-20 01:41:16,294 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 584 transitions. Word has length 99 [2019-11-20 01:41:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:16,294 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 584 transitions. [2019-11-20 01:41:16,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 584 transitions. [2019-11-20 01:41:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:41:16,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:16,296 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:16,296 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash -32577404, now seen corresponding path program 1 times [2019-11-20 01:41:16,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:16,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386153227] [2019-11-20 01:41:16,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 01:41:16,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386153227] [2019-11-20 01:41:16,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:16,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:16,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816864272] [2019-11-20 01:41:16,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:16,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,334 INFO L87 Difference]: Start difference. First operand 358 states and 584 transitions. Second operand 3 states. [2019-11-20 01:41:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:16,519 INFO L93 Difference]: Finished difference Result 716 states and 1169 transitions. [2019-11-20 01:41:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:16,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 01:41:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:16,523 INFO L225 Difference]: With dead ends: 716 [2019-11-20 01:41:16,523 INFO L226 Difference]: Without dead ends: 365 [2019-11-20 01:41:16,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-20 01:41:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-20 01:41:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-20 01:41:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 579 transitions. [2019-11-20 01:41:16,542 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 579 transitions. Word has length 100 [2019-11-20 01:41:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:16,542 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 579 transitions. [2019-11-20 01:41:16,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 579 transitions. [2019-11-20 01:41:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 01:41:16,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:16,544 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:16,545 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1057958359, now seen corresponding path program 1 times [2019-11-20 01:41:16,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:16,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631637246] [2019-11-20 01:41:16,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 01:41:16,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631637246] [2019-11-20 01:41:16,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:16,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:16,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774825881] [2019-11-20 01:41:16,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:16,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:16,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,583 INFO L87 Difference]: Start difference. First operand 358 states and 579 transitions. Second operand 3 states. [2019-11-20 01:41:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:16,724 INFO L93 Difference]: Finished difference Result 734 states and 1188 transitions. [2019-11-20 01:41:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:16,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 01:41:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:16,728 INFO L225 Difference]: With dead ends: 734 [2019-11-20 01:41:16,728 INFO L226 Difference]: Without dead ends: 383 [2019-11-20 01:41:16,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-20 01:41:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-20 01:41:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-20 01:41:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 608 transitions. [2019-11-20 01:41:16,750 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 608 transitions. Word has length 104 [2019-11-20 01:41:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:16,750 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 608 transitions. [2019-11-20 01:41:16,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2019-11-20 01:41:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 01:41:16,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:16,753 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:16,753 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash -278357315, now seen corresponding path program 1 times [2019-11-20 01:41:16,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:16,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804618644] [2019-11-20 01:41:16,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 01:41:16,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804618644] [2019-11-20 01:41:16,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:16,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:16,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157558279] [2019-11-20 01:41:16,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:16,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,799 INFO L87 Difference]: Start difference. First operand 379 states and 608 transitions. Second operand 3 states. [2019-11-20 01:41:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:16,966 INFO L93 Difference]: Finished difference Result 755 states and 1211 transitions. [2019-11-20 01:41:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:16,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 01:41:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:16,969 INFO L225 Difference]: With dead ends: 755 [2019-11-20 01:41:16,969 INFO L226 Difference]: Without dead ends: 383 [2019-11-20 01:41:16,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-20 01:41:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-20 01:41:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-20 01:41:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 602 transitions. [2019-11-20 01:41:16,987 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 602 transitions. Word has length 105 [2019-11-20 01:41:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:16,987 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 602 transitions. [2019-11-20 01:41:16,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 602 transitions. [2019-11-20 01:41:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 01:41:16,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:16,990 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:16,990 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash 138382894, now seen corresponding path program 1 times [2019-11-20 01:41:16,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:16,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004136998] [2019-11-20 01:41:16,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 01:41:17,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004136998] [2019-11-20 01:41:17,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:17,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:17,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576232436] [2019-11-20 01:41:17,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:17,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:17,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:17,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,058 INFO L87 Difference]: Start difference. First operand 379 states and 602 transitions. Second operand 3 states. [2019-11-20 01:41:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:17,121 INFO L93 Difference]: Finished difference Result 1117 states and 1778 transitions. [2019-11-20 01:41:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:17,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 01:41:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:17,127 INFO L225 Difference]: With dead ends: 1117 [2019-11-20 01:41:17,127 INFO L226 Difference]: Without dead ends: 745 [2019-11-20 01:41:17,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-20 01:41:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-20 01:41:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-20 01:41:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1181 transitions. [2019-11-20 01:41:17,156 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1181 transitions. Word has length 120 [2019-11-20 01:41:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:17,156 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1181 transitions. [2019-11-20 01:41:17,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1181 transitions. [2019-11-20 01:41:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 01:41:17,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:17,159 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:17,159 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2017513840, now seen corresponding path program 1 times [2019-11-20 01:41:17,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:17,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822433153] [2019-11-20 01:41:17,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 01:41:17,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822433153] [2019-11-20 01:41:17,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:17,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:17,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895081960] [2019-11-20 01:41:17,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:17,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:17,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:17,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,213 INFO L87 Difference]: Start difference. First operand 745 states and 1181 transitions. Second operand 3 states. [2019-11-20 01:41:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:17,272 INFO L93 Difference]: Finished difference Result 1117 states and 1772 transitions. [2019-11-20 01:41:17,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:17,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 01:41:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:17,279 INFO L225 Difference]: With dead ends: 1117 [2019-11-20 01:41:17,279 INFO L226 Difference]: Without dead ends: 1115 [2019-11-20 01:41:17,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-11-20 01:41:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2019-11-20 01:41:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-20 01:41:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1769 transitions. [2019-11-20 01:41:17,323 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1769 transitions. Word has length 120 [2019-11-20 01:41:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:17,323 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1769 transitions. [2019-11-20 01:41:17,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1769 transitions. [2019-11-20 01:41:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 01:41:17,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:17,327 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:17,327 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash -888705079, now seen corresponding path program 1 times [2019-11-20 01:41:17,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:17,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182484353] [2019-11-20 01:41:17,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 01:41:17,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182484353] [2019-11-20 01:41:17,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:17,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:17,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878428964] [2019-11-20 01:41:17,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:17,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:17,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,374 INFO L87 Difference]: Start difference. First operand 1115 states and 1769 transitions. Second operand 3 states. [2019-11-20 01:41:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:17,585 INFO L93 Difference]: Finished difference Result 2349 states and 3730 transitions. [2019-11-20 01:41:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:17,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 01:41:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:17,593 INFO L225 Difference]: With dead ends: 2349 [2019-11-20 01:41:17,593 INFO L226 Difference]: Without dead ends: 1241 [2019-11-20 01:41:17,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-20 01:41:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1229. [2019-11-20 01:41:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-11-20 01:41:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1946 transitions. [2019-11-20 01:41:17,640 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1946 transitions. Word has length 121 [2019-11-20 01:41:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:17,640 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 1946 transitions. [2019-11-20 01:41:17,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1946 transitions. [2019-11-20 01:41:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 01:41:17,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:17,645 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:17,645 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 601692112, now seen corresponding path program 1 times [2019-11-20 01:41:17,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:17,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477843704] [2019-11-20 01:41:17,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 01:41:17,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477843704] [2019-11-20 01:41:17,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:17,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:17,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385791940] [2019-11-20 01:41:17,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:17,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:17,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:17,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,684 INFO L87 Difference]: Start difference. First operand 1229 states and 1946 transitions. Second operand 3 states. [2019-11-20 01:41:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:17,888 INFO L93 Difference]: Finished difference Result 2463 states and 3898 transitions. [2019-11-20 01:41:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:17,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-20 01:41:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:17,897 INFO L225 Difference]: With dead ends: 2463 [2019-11-20 01:41:17,898 INFO L226 Difference]: Without dead ends: 1235 [2019-11-20 01:41:17,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-20 01:41:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-20 01:41:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-20 01:41:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1928 transitions. [2019-11-20 01:41:17,947 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1928 transitions. Word has length 122 [2019-11-20 01:41:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:17,948 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1928 transitions. [2019-11-20 01:41:17,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1928 transitions. [2019-11-20 01:41:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 01:41:17,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:17,952 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:17,952 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1105504061, now seen corresponding path program 1 times [2019-11-20 01:41:17,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:17,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807428938] [2019-11-20 01:41:17,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 01:41:17,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807428938] [2019-11-20 01:41:17,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:17,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:17,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183975520] [2019-11-20 01:41:17,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:17,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:17,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:17,995 INFO L87 Difference]: Start difference. First operand 1223 states and 1928 transitions. Second operand 3 states. [2019-11-20 01:41:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:18,190 INFO L93 Difference]: Finished difference Result 2553 states and 4025 transitions. [2019-11-20 01:41:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:18,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-20 01:41:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:18,199 INFO L225 Difference]: With dead ends: 2553 [2019-11-20 01:41:18,199 INFO L226 Difference]: Without dead ends: 1337 [2019-11-20 01:41:18,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-20 01:41:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1331. [2019-11-20 01:41:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-11-20 01:41:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2090 transitions. [2019-11-20 01:41:18,252 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2090 transitions. Word has length 154 [2019-11-20 01:41:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:18,252 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 2090 transitions. [2019-11-20 01:41:18,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2090 transitions. [2019-11-20 01:41:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 01:41:18,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:18,256 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:18,257 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2116162422, now seen corresponding path program 1 times [2019-11-20 01:41:18,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:18,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783756989] [2019-11-20 01:41:18,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 01:41:18,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783756989] [2019-11-20 01:41:18,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:18,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:18,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612403083] [2019-11-20 01:41:18,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:18,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:18,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:18,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:18,303 INFO L87 Difference]: Start difference. First operand 1331 states and 2090 transitions. Second operand 3 states. [2019-11-20 01:41:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:18,493 INFO L93 Difference]: Finished difference Result 2661 states and 4175 transitions. [2019-11-20 01:41:18,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:18,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-20 01:41:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:18,502 INFO L225 Difference]: With dead ends: 2661 [2019-11-20 01:41:18,502 INFO L226 Difference]: Without dead ends: 1331 [2019-11-20 01:41:18,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-11-20 01:41:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1325. [2019-11-20 01:41:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-11-20 01:41:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2069 transitions. [2019-11-20 01:41:18,563 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2069 transitions. Word has length 155 [2019-11-20 01:41:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:18,563 INFO L462 AbstractCegarLoop]: Abstraction has 1325 states and 2069 transitions. [2019-11-20 01:41:18,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2069 transitions. [2019-11-20 01:41:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 01:41:18,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:18,568 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:18,569 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash 926552750, now seen corresponding path program 1 times [2019-11-20 01:41:18,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:18,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129795831] [2019-11-20 01:41:18,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-20 01:41:18,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129795831] [2019-11-20 01:41:18,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:18,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:18,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806537611] [2019-11-20 01:41:18,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:18,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:18,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:18,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:18,666 INFO L87 Difference]: Start difference. First operand 1325 states and 2069 transitions. Second operand 3 states. [2019-11-20 01:41:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:18,859 INFO L93 Difference]: Finished difference Result 2751 states and 4295 transitions. [2019-11-20 01:41:18,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:18,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-20 01:41:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:18,867 INFO L225 Difference]: With dead ends: 2751 [2019-11-20 01:41:18,868 INFO L226 Difference]: Without dead ends: 1433 [2019-11-20 01:41:18,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-11-20 01:41:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1427. [2019-11-20 01:41:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-11-20 01:41:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2216 transitions. [2019-11-20 01:41:18,920 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2216 transitions. Word has length 185 [2019-11-20 01:41:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:18,921 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 2216 transitions. [2019-11-20 01:41:18,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2216 transitions. [2019-11-20 01:41:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 01:41:18,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:18,926 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:18,926 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash 405410805, now seen corresponding path program 1 times [2019-11-20 01:41:18,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:18,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187788567] [2019-11-20 01:41:18,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-20 01:41:18,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187788567] [2019-11-20 01:41:18,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:18,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:18,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253100054] [2019-11-20 01:41:18,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:18,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:18,988 INFO L87 Difference]: Start difference. First operand 1427 states and 2216 transitions. Second operand 3 states. [2019-11-20 01:41:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:19,164 INFO L93 Difference]: Finished difference Result 2853 states and 4427 transitions. [2019-11-20 01:41:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:19,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-20 01:41:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:19,174 INFO L225 Difference]: With dead ends: 2853 [2019-11-20 01:41:19,174 INFO L226 Difference]: Without dead ends: 1427 [2019-11-20 01:41:19,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-20 01:41:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1421. [2019-11-20 01:41:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-11-20 01:41:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2192 transitions. [2019-11-20 01:41:19,228 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2192 transitions. Word has length 186 [2019-11-20 01:41:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:19,228 INFO L462 AbstractCegarLoop]: Abstraction has 1421 states and 2192 transitions. [2019-11-20 01:41:19,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2192 transitions. [2019-11-20 01:41:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-20 01:41:19,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:19,234 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:19,234 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 311594383, now seen corresponding path program 1 times [2019-11-20 01:41:19,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:19,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999256597] [2019-11-20 01:41:19,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-20 01:41:19,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999256597] [2019-11-20 01:41:19,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:19,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:19,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258211163] [2019-11-20 01:41:19,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:19,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:19,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:19,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:19,303 INFO L87 Difference]: Start difference. First operand 1421 states and 2192 transitions. Second operand 3 states. [2019-11-20 01:41:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:19,470 INFO L93 Difference]: Finished difference Result 2946 states and 4556 transitions. [2019-11-20 01:41:19,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:19,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-20 01:41:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:19,481 INFO L225 Difference]: With dead ends: 2946 [2019-11-20 01:41:19,481 INFO L226 Difference]: Without dead ends: 1532 [2019-11-20 01:41:19,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-20 01:41:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-20 01:41:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-20 01:41:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2288 transitions. [2019-11-20 01:41:19,540 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2288 transitions. Word has length 203 [2019-11-20 01:41:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:19,540 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2288 transitions. [2019-11-20 01:41:19,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2288 transitions. [2019-11-20 01:41:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 01:41:19,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:19,545 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:19,546 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1374927291, now seen corresponding path program 1 times [2019-11-20 01:41:19,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:19,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886443921] [2019-11-20 01:41:19,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-20 01:41:19,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886443921] [2019-11-20 01:41:19,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:19,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:19,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351544818] [2019-11-20 01:41:19,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:19,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:19,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:19,603 INFO L87 Difference]: Start difference. First operand 1496 states and 2288 transitions. Second operand 3 states. [2019-11-20 01:41:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:19,776 INFO L93 Difference]: Finished difference Result 3021 states and 4625 transitions. [2019-11-20 01:41:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:19,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-20 01:41:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:19,786 INFO L225 Difference]: With dead ends: 3021 [2019-11-20 01:41:19,786 INFO L226 Difference]: Without dead ends: 1532 [2019-11-20 01:41:19,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-20 01:41:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-20 01:41:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-20 01:41:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2261 transitions. [2019-11-20 01:41:19,850 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2261 transitions. Word has length 204 [2019-11-20 01:41:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:19,851 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2261 transitions. [2019-11-20 01:41:19,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2261 transitions. [2019-11-20 01:41:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-20 01:41:19,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:19,856 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:19,856 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1705472573, now seen corresponding path program 1 times [2019-11-20 01:41:19,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:19,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040147108] [2019-11-20 01:41:19,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-20 01:41:19,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040147108] [2019-11-20 01:41:19,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:19,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:19,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040232743] [2019-11-20 01:41:19,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:19,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:19,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:19,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:19,965 INFO L87 Difference]: Start difference. First operand 1496 states and 2261 transitions. Second operand 3 states. [2019-11-20 01:41:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:20,148 INFO L93 Difference]: Finished difference Result 2997 states and 4526 transitions. [2019-11-20 01:41:20,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:20,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-20 01:41:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:20,157 INFO L225 Difference]: With dead ends: 2997 [2019-11-20 01:41:20,158 INFO L226 Difference]: Without dead ends: 1508 [2019-11-20 01:41:20,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-11-20 01:41:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1496. [2019-11-20 01:41:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-20 01:41:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2243 transitions. [2019-11-20 01:41:20,221 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2243 transitions. Word has length 216 [2019-11-20 01:41:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:20,222 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2243 transitions. [2019-11-20 01:41:20,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2243 transitions. [2019-11-20 01:41:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 01:41:20,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:20,227 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:20,227 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:20,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2105710730, now seen corresponding path program 1 times [2019-11-20 01:41:20,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:20,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369013606] [2019-11-20 01:41:20,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-20 01:41:20,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369013606] [2019-11-20 01:41:20,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:20,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:20,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046470413] [2019-11-20 01:41:20,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:20,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:20,294 INFO L87 Difference]: Start difference. First operand 1496 states and 2243 transitions. Second operand 3 states. [2019-11-20 01:41:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:20,476 INFO L93 Difference]: Finished difference Result 2997 states and 4490 transitions. [2019-11-20 01:41:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:20,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-20 01:41:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:20,486 INFO L225 Difference]: With dead ends: 2997 [2019-11-20 01:41:20,486 INFO L226 Difference]: Without dead ends: 1481 [2019-11-20 01:41:20,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-20 01:41:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1469. [2019-11-20 01:41:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-11-20 01:41:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2186 transitions. [2019-11-20 01:41:20,556 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2186 transitions. Word has length 217 [2019-11-20 01:41:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:20,556 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 2186 transitions. [2019-11-20 01:41:20,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2186 transitions. [2019-11-20 01:41:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 01:41:20,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:20,562 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:20,562 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:20,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash 721369725, now seen corresponding path program 1 times [2019-11-20 01:41:20,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:20,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242661988] [2019-11-20 01:41:20,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-20 01:41:20,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242661988] [2019-11-20 01:41:20,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:20,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:20,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286427267] [2019-11-20 01:41:20,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:20,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:20,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:20,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:20,623 INFO L87 Difference]: Start difference. First operand 1469 states and 2186 transitions. Second operand 3 states. [2019-11-20 01:41:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:20,814 INFO L93 Difference]: Finished difference Result 2986 states and 4447 transitions. [2019-11-20 01:41:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:20,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-20 01:41:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:20,823 INFO L225 Difference]: With dead ends: 2986 [2019-11-20 01:41:20,823 INFO L226 Difference]: Without dead ends: 1524 [2019-11-20 01:41:20,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2019-11-20 01:41:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1515. [2019-11-20 01:41:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-20 01:41:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2230 transitions. [2019-11-20 01:41:20,890 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2230 transitions. Word has length 223 [2019-11-20 01:41:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:20,890 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2230 transitions. [2019-11-20 01:41:20,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2230 transitions. [2019-11-20 01:41:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 01:41:20,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:20,896 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:20,897 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash 194394121, now seen corresponding path program 1 times [2019-11-20 01:41:20,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:20,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699729754] [2019-11-20 01:41:20,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-20 01:41:20,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699729754] [2019-11-20 01:41:20,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:20,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:41:20,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499571489] [2019-11-20 01:41:20,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:20,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:20,962 INFO L87 Difference]: Start difference. First operand 1515 states and 2230 transitions. Second operand 3 states. [2019-11-20 01:41:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:21,133 INFO L93 Difference]: Finished difference Result 2605 states and 3838 transitions. [2019-11-20 01:41:21,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:21,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-20 01:41:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:21,139 INFO L225 Difference]: With dead ends: 2605 [2019-11-20 01:41:21,140 INFO L226 Difference]: Without dead ends: 1085 [2019-11-20 01:41:21,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-11-20 01:41:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1079. [2019-11-20 01:41:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-20 01:41:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1573 transitions. [2019-11-20 01:41:21,184 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1573 transitions. Word has length 224 [2019-11-20 01:41:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:21,185 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1573 transitions. [2019-11-20 01:41:21,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1573 transitions. [2019-11-20 01:41:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-20 01:41:21,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:21,190 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:21,190 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1786104814, now seen corresponding path program 1 times [2019-11-20 01:41:21,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:21,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161948514] [2019-11-20 01:41:21,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-20 01:41:21,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161948514] [2019-11-20 01:41:21,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703888366] [2019-11-20 01:41:21,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:41:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:21,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:41:21,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:41:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-20 01:41:21,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:41:21,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 01:41:21,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968638209] [2019-11-20 01:41:21,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:21,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:21,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:41:21,641 INFO L87 Difference]: Start difference. First operand 1079 states and 1573 transitions. Second operand 3 states. [2019-11-20 01:41:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:21,747 INFO L93 Difference]: Finished difference Result 2658 states and 3873 transitions. [2019-11-20 01:41:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:21,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-20 01:41:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:21,766 INFO L225 Difference]: With dead ends: 2658 [2019-11-20 01:41:21,772 INFO L226 Difference]: Without dead ends: 1586 [2019-11-20 01:41:21,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:41:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-11-20 01:41:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2019-11-20 01:41:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-20 01:41:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2310 transitions. [2019-11-20 01:41:21,840 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2310 transitions. Word has length 260 [2019-11-20 01:41:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:21,841 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2310 transitions. [2019-11-20 01:41:21,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2310 transitions. [2019-11-20 01:41:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-20 01:41:21,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:21,847 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:22,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:41:22,052 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1088106038, now seen corresponding path program 1 times [2019-11-20 01:41:22,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:22,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666793198] [2019-11-20 01:41:22,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-20 01:41:22,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666793198] [2019-11-20 01:41:22,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:22,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:22,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898778540] [2019-11-20 01:41:22,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:22,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:22,199 INFO L87 Difference]: Start difference. First operand 1586 states and 2310 transitions. Second operand 3 states. [2019-11-20 01:41:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:22,317 INFO L93 Difference]: Finished difference Result 4663 states and 6788 transitions. [2019-11-20 01:41:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:22,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-20 01:41:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:22,325 INFO L225 Difference]: With dead ends: 4663 [2019-11-20 01:41:22,325 INFO L226 Difference]: Without dead ends: 3084 [2019-11-20 01:41:22,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2019-11-20 01:41:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3082. [2019-11-20 01:41:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-11-20 01:41:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4479 transitions. [2019-11-20 01:41:22,459 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4479 transitions. Word has length 270 [2019-11-20 01:41:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:22,460 INFO L462 AbstractCegarLoop]: Abstraction has 3082 states and 4479 transitions. [2019-11-20 01:41:22,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4479 transitions. [2019-11-20 01:41:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-20 01:41:22,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:22,469 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:22,469 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 420200473, now seen corresponding path program 1 times [2019-11-20 01:41:22,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:22,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714977439] [2019-11-20 01:41:22,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-20 01:41:22,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714977439] [2019-11-20 01:41:22,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:22,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:22,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639733243] [2019-11-20 01:41:22,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:22,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:22,576 INFO L87 Difference]: Start difference. First operand 3082 states and 4479 transitions. Second operand 3 states. [2019-11-20 01:41:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:22,849 INFO L93 Difference]: Finished difference Result 6317 states and 9203 transitions. [2019-11-20 01:41:22,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:22,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-20 01:41:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:22,855 INFO L225 Difference]: With dead ends: 6317 [2019-11-20 01:41:22,856 INFO L226 Difference]: Without dead ends: 2034 [2019-11-20 01:41:22,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-11-20 01:41:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2014. [2019-11-20 01:41:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-11-20 01:41:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2877 transitions. [2019-11-20 01:41:22,932 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2877 transitions. Word has length 307 [2019-11-20 01:41:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:22,932 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 2877 transitions. [2019-11-20 01:41:22,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2877 transitions. [2019-11-20 01:41:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-11-20 01:41:22,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:22,941 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:22,941 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash 982370538, now seen corresponding path program 1 times [2019-11-20 01:41:22,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:22,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612325353] [2019-11-20 01:41:22,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-20 01:41:23,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612325353] [2019-11-20 01:41:23,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226082313] [2019-11-20 01:41:23,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:41:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:23,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:41:23,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:41:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-20 01:41:23,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:41:23,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 01:41:23,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133644026] [2019-11-20 01:41:23,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:41:23,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:41:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:41:23,393 INFO L87 Difference]: Start difference. First operand 2014 states and 2877 transitions. Second operand 4 states. [2019-11-20 01:41:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:23,726 INFO L93 Difference]: Finished difference Result 4694 states and 6697 transitions. [2019-11-20 01:41:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:41:23,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-11-20 01:41:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:23,732 INFO L225 Difference]: With dead ends: 4694 [2019-11-20 01:41:23,732 INFO L226 Difference]: Without dead ends: 2643 [2019-11-20 01:41:23,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:41:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-11-20 01:41:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1989. [2019-11-20 01:41:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-20 01:41:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-20 01:41:23,815 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 372 [2019-11-20 01:41:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:23,816 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-20 01:41:23,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:41:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-20 01:41:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-11-20 01:41:23,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:23,832 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:24,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:41:24,038 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1689104854, now seen corresponding path program 1 times [2019-11-20 01:41:24,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:24,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528465796] [2019-11-20 01:41:24,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-20 01:41:24,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528465796] [2019-11-20 01:41:24,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526980351] [2019-11-20 01:41:24,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:41:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:24,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:41:24,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:41:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-20 01:41:24,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:41:24,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 01:41:24,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081627527] [2019-11-20 01:41:24,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:41:24,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:41:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:41:24,903 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 4 states. [2019-11-20 01:41:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:25,235 INFO L93 Difference]: Finished difference Result 4937 states and 6862 transitions. [2019-11-20 01:41:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:41:25,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-11-20 01:41:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:25,242 INFO L225 Difference]: With dead ends: 4937 [2019-11-20 01:41:25,242 INFO L226 Difference]: Without dead ends: 2814 [2019-11-20 01:41:25,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:41:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2019-11-20 01:41:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 1989. [2019-11-20 01:41:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-20 01:41:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-20 01:41:25,320 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 600 [2019-11-20 01:41:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:25,321 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-20 01:41:25,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:41:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-20 01:41:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-11-20 01:41:25,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:25,338 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:25,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:41:25,543 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1687662778, now seen corresponding path program 1 times [2019-11-20 01:41:25,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:25,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740670171] [2019-11-20 01:41:25,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-20 01:41:25,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740670171] [2019-11-20 01:41:25,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:25,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:25,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481266311] [2019-11-20 01:41:25,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:25,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:25,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:25,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:25,923 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 3 states. [2019-11-20 01:41:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:26,115 INFO L93 Difference]: Finished difference Result 4007 states and 5539 transitions. [2019-11-20 01:41:26,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:26,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 667 [2019-11-20 01:41:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:26,120 INFO L225 Difference]: With dead ends: 4007 [2019-11-20 01:41:26,120 INFO L226 Difference]: Without dead ends: 2025 [2019-11-20 01:41:26,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-11-20 01:41:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1989. [2019-11-20 01:41:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-20 01:41:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2733 transitions. [2019-11-20 01:41:26,195 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2733 transitions. Word has length 667 [2019-11-20 01:41:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:26,196 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2733 transitions. [2019-11-20 01:41:26,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2733 transitions. [2019-11-20 01:41:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-11-20 01:41:26,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:26,217 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:26,217 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1182124796, now seen corresponding path program 1 times [2019-11-20 01:41:26,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:26,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413831437] [2019-11-20 01:41:26,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-20 01:41:26,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413831437] [2019-11-20 01:41:26,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:26,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:26,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650713594] [2019-11-20 01:41:26,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:26,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:26,692 INFO L87 Difference]: Start difference. First operand 1989 states and 2733 transitions. Second operand 3 states. [2019-11-20 01:41:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:26,897 INFO L93 Difference]: Finished difference Result 3986 states and 5473 transitions. [2019-11-20 01:41:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:26,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 681 [2019-11-20 01:41:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:26,901 INFO L225 Difference]: With dead ends: 3986 [2019-11-20 01:41:26,902 INFO L226 Difference]: Without dead ends: 2004 [2019-11-20 01:41:26,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-11-20 01:41:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1976. [2019-11-20 01:41:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-11-20 01:41:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2674 transitions. [2019-11-20 01:41:26,972 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2674 transitions. Word has length 681 [2019-11-20 01:41:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:26,973 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 2674 transitions. [2019-11-20 01:41:26,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2674 transitions. [2019-11-20 01:41:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-11-20 01:41:26,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:26,993 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:41:26,993 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash 8635284, now seen corresponding path program 1 times [2019-11-20 01:41:26,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:26,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832439844] [2019-11-20 01:41:26,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-20 01:41:27,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832439844] [2019-11-20 01:41:27,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:27,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:27,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980577215] [2019-11-20 01:41:27,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:27,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:27,368 INFO L87 Difference]: Start difference. First operand 1976 states and 2674 transitions. Second operand 3 states. [2019-11-20 01:41:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:27,567 INFO L93 Difference]: Finished difference Result 4014 states and 5435 transitions. [2019-11-20 01:41:27,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:27,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 710 [2019-11-20 01:41:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:27,572 INFO L225 Difference]: With dead ends: 4014 [2019-11-20 01:41:27,572 INFO L226 Difference]: Without dead ends: 2027 [2019-11-20 01:41:27,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-20 01:41:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2018. [2019-11-20 01:41:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-11-20 01:41:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2719 transitions. [2019-11-20 01:41:27,650 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2719 transitions. Word has length 710 [2019-11-20 01:41:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:27,650 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 2719 transitions. [2019-11-20 01:41:27,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2719 transitions. [2019-11-20 01:41:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2019-11-20 01:41:27,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:41:27,673 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2019-11-20 01:41:27,674 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:41:27,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:41:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1819983258, now seen corresponding path program 1 times [2019-11-20 01:41:27,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:41:27,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141366099] [2019-11-20 01:41:27,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:41:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:41:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-20 01:41:28,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141366099] [2019-11-20 01:41:28,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:41:28,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:41:28,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779264989] [2019-11-20 01:41:28,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:41:28,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:41:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:41:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:28,086 INFO L87 Difference]: Start difference. First operand 2018 states and 2719 transitions. Second operand 3 states. [2019-11-20 01:41:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:41:28,234 INFO L93 Difference]: Finished difference Result 2591 states and 3474 transitions. [2019-11-20 01:41:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:41:28,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 725 [2019-11-20 01:41:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:41:28,236 INFO L225 Difference]: With dead ends: 2591 [2019-11-20 01:41:28,236 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:41:28,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:41:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:41:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:41:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:41:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:41:28,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 725 [2019-11-20 01:41:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:41:28,241 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:41:28,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:41:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:41:28,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:41:28,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:41:29,052 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-20 01:41:29,439 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-20 01:41:29,864 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-20 01:41:30,374 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-20 01:41:30,869 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-20 01:41:31,372 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-20 01:41:31,792 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-20 01:41:32,195 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-20 01:41:32,624 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-20 01:41:33,015 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-20 01:41:33,494 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 01:41:33,961 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 01:41:34,377 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-20 01:41:34,845 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-20 01:41:35,363 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-20 01:41:35,873 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-20 01:41:36,664 WARN L191 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-20 01:41:37,032 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-20 01:41:37,498 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-11-20 01:41:37,879 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-20 01:41:38,326 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-20 01:41:39,095 WARN L191 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-20 01:41:39,098 INFO L444 ceAbstractionStarter]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-20 01:41:39,099 INFO L444 ceAbstractionStarter]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-20 01:41:39,099 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-20 01:41:39,099 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-20 01:41:39,099 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 628) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-20 01:41:39,099 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-20 01:41:39,099 INFO L444 ceAbstractionStarter]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 01:41:39,099 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-20 01:41:39,100 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-20 01:41:39,100 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-20 01:41:39,100 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-20 01:41:39,100 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-20 01:41:39,100 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-20 01:41:39,100 INFO L444 ceAbstractionStarter]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 01:41:39,100 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 01:41:39,100 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-20 01:41:39,101 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11)))) [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-20 01:41:39,101 INFO L440 ceAbstractionStarter]: At program point L404(lines 395 415) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-20 01:41:39,101 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-20 01:41:39,101 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-20 01:41:39,102 INFO L444 ceAbstractionStarter]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-20 01:41:39,103 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,103 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 615) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,103 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-20 01:41:39,103 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 627) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,103 INFO L447 ceAbstractionStarter]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-20 01:41:39,103 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-20 01:41:39,103 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-20 01:41:39,103 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-20 01:41:39,104 INFO L444 ceAbstractionStarter]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-20 01:41:39,104 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-20 01:41:39,107 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-20 01:41:39,107 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-20 01:41:39,107 INFO L447 ceAbstractionStarter]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-20 01:41:39,107 INFO L444 ceAbstractionStarter]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-20 01:41:39,107 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-20 01:41:39,107 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-20 01:41:39,107 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-20 01:41:39,108 INFO L444 ceAbstractionStarter]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-20 01:41:39,108 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-20 01:41:39,108 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-20 01:41:39,108 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-20 01:41:39,109 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-20 01:41:39,109 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-20 01:41:39,109 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-20 01:41:39,110 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-20 01:41:39,110 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,110 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-20 01:41:39,111 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-20 01:41:39,112 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-20 01:41:39,112 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-20 01:41:39,112 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-20 01:41:39,112 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 623) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 01:41:39,112 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-20 01:41:39,113 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-20 01:41:39,113 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-20 01:41:39,113 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-20 01:41:39,113 INFO L444 ceAbstractionStarter]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-20 01:41:39,113 INFO L444 ceAbstractionStarter]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-20 01:41:39,113 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-20 01:41:39,113 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-20 01:41:39,114 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-20 01:41:39,114 INFO L440 ceAbstractionStarter]: At program point L553(lines 65 677) the Hoare annotation is: false [2019-11-20 01:41:39,114 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-20 01:41:39,114 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:41:39,114 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,115 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,115 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 621) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 01:41:39,115 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-20 01:41:39,115 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-20 01:41:39,116 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-20 01:41:39,116 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-20 01:41:39,116 INFO L447 ceAbstractionStarter]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-20 01:41:39,116 INFO L444 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-20 01:41:39,116 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:41:39,116 INFO L440 ceAbstractionStarter]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,117 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-20 01:41:39,117 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-20 01:41:39,117 INFO L440 ceAbstractionStarter]: At program point L360(lines 342 378) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,117 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-20 01:41:39,117 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-20 01:41:39,117 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-20 01:41:39,118 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-20 01:41:39,118 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-20 01:41:39,118 INFO L444 ceAbstractionStarter]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 01:41:39,118 INFO L440 ceAbstractionStarter]: At program point L394(lines 385 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,118 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-20 01:41:39,119 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21))) [2019-11-20 01:41:39,119 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 609) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,119 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-20 01:41:39,119 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-20 01:41:39,120 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 671) no Hoare annotation was computed. [2019-11-20 01:41:39,120 INFO L447 ceAbstractionStarter]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-20 01:41:39,120 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-20 01:41:39,120 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-20 01:41:39,120 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-20 01:41:39,120 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-20 01:41:39,120 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-20 01:41:39,121 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,121 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-20 01:41:39,121 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 620) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 01:41:39,122 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 01:41:39,123 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-20 01:41:39,123 INFO L444 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-20 01:41:39,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:41:39 BoogieIcfgContainer [2019-11-20 01:41:39,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:41:39,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:41:39,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:41:39,193 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:41:39,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:41:12" (3/4) ... [2019-11-20 01:41:39,198 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:41:39,223 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 01:41:39,224 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:41:39,421 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_113acd73-ac1b-441f-8f8b-a2e398cc15fc/bin/uautomizer/witness.graphml [2019-11-20 01:41:39,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:41:39,423 INFO L168 Benchmark]: Toolchain (without parser) took 28358.80 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -85.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-20 01:41:39,423 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:41:39,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:41:39,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.39 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:41:39,425 INFO L168 Benchmark]: Boogie Preprocessor took 60.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:41:39,425 INFO L168 Benchmark]: RCFGBuilder took 869.40 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: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:41:39,426 INFO L168 Benchmark]: TraceAbstraction took 26557.22 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 989.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -5.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-20 01:41:39,426 INFO L168 Benchmark]: Witness Printer took 228.82 ms. Allocated memory is still 2.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:41:39,429 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 571.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.39 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 869.40 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: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26557.22 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 989.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -5.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 228.82 ms. Allocated memory is still 2.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 671]: 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: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) || ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && 8448 <= s__state) || (((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8640)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8640)) && !(0 == s__hit)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 1 error locations. Result: SAFE, OverallTime: 26.4s, OverallIterations: 37, TraceHistogramMax: 25, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.8s, HoareTripleCheckerStatistics: 5821 SDtfs, 4958 SDslu, 2005 SDs, 0 SdLazy, 3403 SolverSat, 1378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 1278 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 227 NumberOfFragments, 3561 HoareAnnotationTreeSize, 29 FomulaSimplifications, 33306 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7556 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 9471 NumberOfCodeBlocks, 9471 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9431 ConstructedInterpolants, 0 QuantifiedInterpolants, 4588760 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1910 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 40 InterpolantComputations, 35 PerfectInterpolantSequences, 40583/40713 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...