./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/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 64a8f3377d83624025022bfde8edd1f829e70f73 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:55:51,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:55:51,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:55:51,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:55:51,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:55:51,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:55:51,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:55:51,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:55:51,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:55:51,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:55:51,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:55:51,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:55:51,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:55:51,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:55:51,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:55:51,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:55:51,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:55:51,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:55:51,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:55:51,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:55:51,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:55:51,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:55:51,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:55:51,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:55:51,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:55:51,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:55:51,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:55:51,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:55:51,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:55:51,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:55:51,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:55:51,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:55:51,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:55:51,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:55:51,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:55:51,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:55:51,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:55:51,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:55:51,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:55:51,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:55:51,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:55:51,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:55:51,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:55:51,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:55:51,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:55:51,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:55:51,165 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:55:51,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:55:51,166 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:55:51,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:55:51,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:55:51,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:55:51,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:55:51,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:55:51,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:55:51,167 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:55:51,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:55:51,167 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:55:51,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:55:51,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:55:51,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:55:51,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:55:51,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:55:51,169 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:55:51,169 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_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/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 -> 64a8f3377d83624025022bfde8edd1f829e70f73 [2019-12-07 17:55:51,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:55:51,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:55:51,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:55:51,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:55:51,293 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:55:51,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-12-07 17:55:51,338 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/data/9e8ead487/8cf5ebbcc2294954843d9ab67e8b0563/FLAG5a86041b8 [2019-12-07 17:55:51,772 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:55:51,772 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-12-07 17:55:51,780 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/data/9e8ead487/8cf5ebbcc2294954843d9ab67e8b0563/FLAG5a86041b8 [2019-12-07 17:55:51,789 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/data/9e8ead487/8cf5ebbcc2294954843d9ab67e8b0563 [2019-12-07 17:55:51,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:55:51,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:55:51,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:55:51,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:55:51,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:55:51,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:55:51" (1/1) ... [2019-12-07 17:55:51,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17df66d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:51, skipping insertion in model container [2019-12-07 17:55:51,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:55:51" (1/1) ... [2019-12-07 17:55:51,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:55:51,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:55:51,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:55:51,998 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:55:52,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:55:52,041 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:55:52,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52 WrapperNode [2019-12-07 17:55:52,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:55:52,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:55:52,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:55:52,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:55:52,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:55:52,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:55:52,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:55:52,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:55:52,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... [2019-12-07 17:55:52,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:55:52,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:55:52,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:55:52,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:55:52,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/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-12-07 17:55:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:55:52,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:55:52,216 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:55:52,550 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 17:55:52,550 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 17:55:52,551 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:55:52,551 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:55:52,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:52 BoogieIcfgContainer [2019-12-07 17:55:52,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:55:52,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:55:52,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:55:52,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:55:52,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:55:51" (1/3) ... [2019-12-07 17:55:52,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd22058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:55:52, skipping insertion in model container [2019-12-07 17:55:52,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:55:52" (2/3) ... [2019-12-07 17:55:52,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd22058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:55:52, skipping insertion in model container [2019-12-07 17:55:52,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:52" (3/3) ... [2019-12-07 17:55:52,557 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-12-07 17:55:52,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:55:52,568 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:55:52,575 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:55:52,594 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:55:52,594 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:55:52,594 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:55:52,594 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:55:52,594 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:55:52,594 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:55:52,595 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:55:52,595 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:55:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-12-07 17:55:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:55:52,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:52,615 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-12-07 17:55:52,616 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:52,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:52,620 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-12-07 17:55:52,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:52,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348282552] [2019-12-07 17:55:52,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:52,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348282552] [2019-12-07 17:55:52,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:52,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:52,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591632975] [2019-12-07 17:55:52,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:52,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:52,788 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-12-07 17:55:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:52,941 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-12-07 17:55:52,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:52,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 17:55:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:52,952 INFO L225 Difference]: With dead ends: 327 [2019-12-07 17:55:52,952 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 17:55:52,955 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-12-07 17:55:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 17:55:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-12-07 17:55:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 17:55:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-12-07 17:55:52,995 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-12-07 17:55:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:52,995 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-12-07 17:55:52,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-12-07 17:55:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:55:52,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:52,998 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-12-07 17:55:52,998 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-12-07 17:55:52,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:52,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001802364] [2019-12-07 17:55:52,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:53,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001802364] [2019-12-07 17:55:53,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:53,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:53,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519090136] [2019-12-07 17:55:53,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:53,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:53,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:53,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:53,052 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-12-07 17:55:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:53,185 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-12-07 17:55:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:53,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 17:55:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:53,187 INFO L225 Difference]: With dead ends: 379 [2019-12-07 17:55:53,187 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 17:55:53,188 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-12-07 17:55:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 17:55:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-12-07 17:55:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 17:55:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-12-07 17:55:53,201 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-12-07 17:55:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:53,201 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-12-07 17:55:53,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-12-07 17:55:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 17:55:53,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:53,204 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] [2019-12-07 17:55:53,204 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:53,204 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2019-12-07 17:55:53,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:53,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278677860] [2019-12-07 17:55:53,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:53,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278677860] [2019-12-07 17:55:53,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:53,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:53,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509791561] [2019-12-07 17:55:53,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:53,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:53,252 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-12-07 17:55:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:53,360 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-12-07 17:55:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:53,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 17:55:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:53,362 INFO L225 Difference]: With dead ends: 444 [2019-12-07 17:55:53,362 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 17:55:53,364 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-12-07 17:55:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 17:55:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-07 17:55:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 17:55:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-12-07 17:55:53,374 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-12-07 17:55:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:53,375 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-12-07 17:55:53,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-12-07 17:55:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 17:55:53,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:53,377 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] [2019-12-07 17:55:53,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:53,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:53,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2019-12-07 17:55:53,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:53,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124436627] [2019-12-07 17:55:53,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:55:53,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124436627] [2019-12-07 17:55:53,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:53,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:53,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247529873] [2019-12-07 17:55:53,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:53,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:53,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:53,416 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-12-07 17:55:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:53,497 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-12-07 17:55:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:53,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 17:55:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:53,499 INFO L225 Difference]: With dead ends: 492 [2019-12-07 17:55:53,499 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 17:55:53,500 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-12-07 17:55:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 17:55:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-12-07 17:55:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 17:55:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-12-07 17:55:53,510 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-12-07 17:55:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:53,510 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-12-07 17:55:53,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-12-07 17:55:53,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 17:55:53,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:53,511 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-12-07 17:55:53,511 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:53,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:53,512 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2019-12-07 17:55:53,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:53,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160194349] [2019-12-07 17:55:53,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:53,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160194349] [2019-12-07 17:55:53,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:53,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:53,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699966899] [2019-12-07 17:55:53,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:53,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:53,561 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-12-07 17:55:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:53,658 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2019-12-07 17:55:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:53,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 17:55:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:53,660 INFO L225 Difference]: With dead ends: 552 [2019-12-07 17:55:53,660 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 17:55:53,660 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-12-07 17:55:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 17:55:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2019-12-07 17:55:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 17:55:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-12-07 17:55:53,668 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-12-07 17:55:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:53,669 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-12-07 17:55:53,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-12-07 17:55:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 17:55:53,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:53,670 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] [2019-12-07 17:55:53,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2019-12-07 17:55:53,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:53,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260303609] [2019-12-07 17:55:53,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:55:53,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260303609] [2019-12-07 17:55:53,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:53,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:53,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824369003] [2019-12-07 17:55:53,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:53,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:53,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:53,698 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-12-07 17:55:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:53,769 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-12-07 17:55:53,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:53,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 17:55:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:53,771 INFO L225 Difference]: With dead ends: 591 [2019-12-07 17:55:53,771 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 17:55:53,771 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-12-07 17:55:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 17:55:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-12-07 17:55:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 17:55:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-12-07 17:55:53,778 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-12-07 17:55:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:53,778 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-12-07 17:55:53,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-12-07 17:55:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 17:55:53,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:53,779 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-12-07 17:55:53,779 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2019-12-07 17:55:53,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:53,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392960083] [2019-12-07 17:55:53,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:53,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392960083] [2019-12-07 17:55:53,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:53,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:53,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435954728] [2019-12-07 17:55:53,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:53,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:53,810 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-12-07 17:55:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:53,913 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2019-12-07 17:55:53,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:53,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 17:55:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:53,915 INFO L225 Difference]: With dead ends: 594 [2019-12-07 17:55:53,915 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 17:55:53,916 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-12-07 17:55:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 17:55:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2019-12-07 17:55:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-12-07 17:55:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-12-07 17:55:53,923 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-12-07 17:55:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:53,923 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-12-07 17:55:53,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-12-07 17:55:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:55:53,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:53,924 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] [2019-12-07 17:55:53,924 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:53,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2019-12-07 17:55:53,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:53,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830399805] [2019-12-07 17:55:53,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:55:53,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830399805] [2019-12-07 17:55:53,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:53,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:53,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429370109] [2019-12-07 17:55:53,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:53,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:53,959 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-12-07 17:55:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,034 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-12-07 17:55:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 17:55:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,036 INFO L225 Difference]: With dead ends: 594 [2019-12-07 17:55:54,036 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 17:55:54,036 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-12-07 17:55:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 17:55:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-12-07 17:55:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-07 17:55:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-12-07 17:55:54,044 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-12-07 17:55:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,044 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-12-07 17:55:54,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-12-07 17:55:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:55:54,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,045 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] [2019-12-07 17:55:54,046 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2019-12-07 17:55:54,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317853725] [2019-12-07 17:55:54,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:55:54,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317853725] [2019-12-07 17:55:54,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:54,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247252669] [2019-12-07 17:55:54,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:54,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:54,082 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-12-07 17:55:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,174 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-12-07 17:55:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 17:55:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,177 INFO L225 Difference]: With dead ends: 634 [2019-12-07 17:55:54,177 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 17:55:54,177 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-12-07 17:55:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 17:55:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 17:55:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 17:55:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-12-07 17:55:54,185 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-12-07 17:55:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,186 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-12-07 17:55:54,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-12-07 17:55:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:55:54,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,187 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] [2019-12-07 17:55:54,187 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2019-12-07 17:55:54,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747217914] [2019-12-07 17:55:54,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:55:54,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747217914] [2019-12-07 17:55:54,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:54,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98565800] [2019-12-07 17:55:54,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:54,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:54,217 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-12-07 17:55:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,326 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-12-07 17:55:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 17:55:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,328 INFO L225 Difference]: With dead ends: 663 [2019-12-07 17:55:54,328 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 17:55:54,329 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-12-07 17:55:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 17:55:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 17:55:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 17:55:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-12-07 17:55:54,337 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-12-07 17:55:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,338 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-12-07 17:55:54,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-12-07 17:55:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:55:54,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,339 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 17:55:54,339 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2019-12-07 17:55:54,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990380491] [2019-12-07 17:55:54,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:55:54,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990380491] [2019-12-07 17:55:54,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:54,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511936408] [2019-12-07 17:55:54,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:54,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:54,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:54,369 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-12-07 17:55:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,472 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-12-07 17:55:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 17:55:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,475 INFO L225 Difference]: With dead ends: 696 [2019-12-07 17:55:54,475 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 17:55:54,476 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-12-07 17:55:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 17:55:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 17:55:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 17:55:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-12-07 17:55:54,489 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-12-07 17:55:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,489 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-12-07 17:55:54,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-12-07 17:55:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:55:54,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,491 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-12-07 17:55:54,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2019-12-07 17:55:54,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739429374] [2019-12-07 17:55:54,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:55:54,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739429374] [2019-12-07 17:55:54,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:54,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525561821] [2019-12-07 17:55:54,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:54,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:54,522 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-12-07 17:55:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,633 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-12-07 17:55:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 17:55:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,635 INFO L225 Difference]: With dead ends: 723 [2019-12-07 17:55:54,636 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 17:55:54,636 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-12-07 17:55:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 17:55:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 17:55:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 17:55:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-12-07 17:55:54,649 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-12-07 17:55:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,649 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-12-07 17:55:54,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-12-07 17:55:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 17:55:54,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,650 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-12-07 17:55:54,651 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2019-12-07 17:55:54,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343505964] [2019-12-07 17:55:54,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 17:55:54,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343505964] [2019-12-07 17:55:54,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:54,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851551221] [2019-12-07 17:55:54,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:54,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:54,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:54,679 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-12-07 17:55:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,772 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-12-07 17:55:54,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 17:55:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,774 INFO L225 Difference]: With dead ends: 740 [2019-12-07 17:55:54,774 INFO L226 Difference]: Without dead ends: 386 [2019-12-07 17:55:54,775 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-12-07 17:55:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-12-07 17:55:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-12-07 17:55:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 17:55:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-12-07 17:55:54,789 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-12-07 17:55:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,789 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-12-07 17:55:54,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-12-07 17:55:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 17:55:54,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,791 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-12-07 17:55:54,791 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2019-12-07 17:55:54,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453994155] [2019-12-07 17:55:54,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 17:55:54,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453994155] [2019-12-07 17:55:54,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:54,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185595891] [2019-12-07 17:55:54,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:54,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:54,818 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-12-07 17:55:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,904 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-12-07 17:55:54,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 17:55:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:54,907 INFO L225 Difference]: With dead ends: 761 [2019-12-07 17:55:54,907 INFO L226 Difference]: Without dead ends: 386 [2019-12-07 17:55:54,908 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-12-07 17:55:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-12-07 17:55:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-12-07 17:55:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 17:55:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-12-07 17:55:54,921 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-12-07 17:55:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:54,921 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-12-07 17:55:54,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-12-07 17:55:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 17:55:54,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:54,923 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-12-07 17:55:54,923 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2019-12-07 17:55:54,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:54,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118252643] [2019-12-07 17:55:54,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 17:55:54,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118252643] [2019-12-07 17:55:54,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:54,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:54,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925813005] [2019-12-07 17:55:54,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:54,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:54,962 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-12-07 17:55:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:54,997 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-12-07 17:55:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:54,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 17:55:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,002 INFO L225 Difference]: With dead ends: 757 [2019-12-07 17:55:55,002 INFO L226 Difference]: Without dead ends: 755 [2019-12-07 17:55:55,003 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-12-07 17:55:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-12-07 17:55:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-12-07 17:55:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-12-07 17:55:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-12-07 17:55:55,030 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-12-07 17:55:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,030 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-12-07 17:55:55,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-12-07 17:55:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 17:55:55,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,032 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, 1] [2019-12-07 17:55:55,033 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2019-12-07 17:55:55,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200816561] [2019-12-07 17:55:55,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:55:55,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200816561] [2019-12-07 17:55:55,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:55,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222087070] [2019-12-07 17:55:55,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:55,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:55,072 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-12-07 17:55:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,112 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2019-12-07 17:55:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:55,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 17:55:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,116 INFO L225 Difference]: With dead ends: 1831 [2019-12-07 17:55:55,116 INFO L226 Difference]: Without dead ends: 1083 [2019-12-07 17:55:55,117 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-12-07 17:55:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-12-07 17:55:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-12-07 17:55:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-12-07 17:55:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2019-12-07 17:55:55,150 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2019-12-07 17:55:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,150 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2019-12-07 17:55:55,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2019-12-07 17:55:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 17:55:55,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,152 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, 1] [2019-12-07 17:55:55,152 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2019-12-07 17:55:55,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38581537] [2019-12-07 17:55:55,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 17:55:55,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38581537] [2019-12-07 17:55:55,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:55,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691126363] [2019-12-07 17:55:55,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:55,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:55,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:55,177 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2019-12-07 17:55:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,223 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2019-12-07 17:55:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:55,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 17:55:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,231 INFO L225 Difference]: With dead ends: 2528 [2019-12-07 17:55:55,231 INFO L226 Difference]: Without dead ends: 1452 [2019-12-07 17:55:55,233 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-12-07 17:55:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-12-07 17:55:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2019-12-07 17:55:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-12-07 17:55:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2019-12-07 17:55:55,269 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2019-12-07 17:55:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,269 INFO L462 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2019-12-07 17:55:55,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2019-12-07 17:55:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 17:55:55,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,271 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, 1] [2019-12-07 17:55:55,271 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2019-12-07 17:55:55,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300018554] [2019-12-07 17:55:55,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-07 17:55:55,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300018554] [2019-12-07 17:55:55,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:55,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152975863] [2019-12-07 17:55:55,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:55,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:55,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:55,292 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2019-12-07 17:55:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,338 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2019-12-07 17:55:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:55,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 17:55:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,345 INFO L225 Difference]: With dead ends: 3248 [2019-12-07 17:55:55,345 INFO L226 Difference]: Without dead ends: 1803 [2019-12-07 17:55:55,347 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-12-07 17:55:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-07 17:55:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-12-07 17:55:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-12-07 17:55:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2019-12-07 17:55:55,384 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2019-12-07 17:55:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,385 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2019-12-07 17:55:55,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2019-12-07 17:55:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 17:55:55,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,388 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:55,388 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2019-12-07 17:55:55,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789166270] [2019-12-07 17:55:55,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 17:55:55,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789166270] [2019-12-07 17:55:55,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:55,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658780522] [2019-12-07 17:55:55,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:55,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:55,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:55,426 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2019-12-07 17:55:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,570 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2019-12-07 17:55:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:55,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-12-07 17:55:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,581 INFO L225 Difference]: With dead ends: 3649 [2019-12-07 17:55:55,581 INFO L226 Difference]: Without dead ends: 1853 [2019-12-07 17:55:55,583 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-12-07 17:55:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-07 17:55:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2019-12-07 17:55:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-12-07 17:55:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2019-12-07 17:55:55,626 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2019-12-07 17:55:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,626 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2019-12-07 17:55:55,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2019-12-07 17:55:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 17:55:55,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,629 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:55,630 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2019-12-07 17:55:55,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141715633] [2019-12-07 17:55:55,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 17:55:55,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141715633] [2019-12-07 17:55:55,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:55,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:55,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224212204] [2019-12-07 17:55:55,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:55,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:55,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:55,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:55,678 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2019-12-07 17:55:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:55,807 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2019-12-07 17:55:55,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:55,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-12-07 17:55:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:55,814 INFO L225 Difference]: With dead ends: 3666 [2019-12-07 17:55:55,814 INFO L226 Difference]: Without dead ends: 1870 [2019-12-07 17:55:55,816 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-12-07 17:55:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-12-07 17:55:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2019-12-07 17:55:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-12-07 17:55:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2019-12-07 17:55:55,851 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2019-12-07 17:55:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:55,851 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2019-12-07 17:55:55,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2019-12-07 17:55:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-12-07 17:55:55,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:55,854 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:55,854 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:55,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2019-12-07 17:55:55,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:55,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747108256] [2019-12-07 17:55:55,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 17:55:55,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747108256] [2019-12-07 17:55:55,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251507694] [2019-12-07 17:55:55,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/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-12-07 17:55:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:55,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:55:55,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 17:55:56,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:56,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 17:55:56,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416307513] [2019-12-07 17:55:56,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:56,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:56,042 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2019-12-07 17:55:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:56,285 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2019-12-07 17:55:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:56,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-12-07 17:55:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:56,299 INFO L225 Difference]: With dead ends: 4264 [2019-12-07 17:55:56,299 INFO L226 Difference]: Without dead ends: 2435 [2019-12-07 17:55:56,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 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-12-07 17:55:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-12-07 17:55:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2019-12-07 17:55:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-12-07 17:55:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2019-12-07 17:55:56,368 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2019-12-07 17:55:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:56,368 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2019-12-07 17:55:56,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2019-12-07 17:55:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-12-07 17:55:56,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:56,372 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:56,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:56,573 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2019-12-07 17:55:56,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:56,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851498287] [2019-12-07 17:55:56,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-12-07 17:55:56,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851498287] [2019-12-07 17:55:56,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:56,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:56,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055237657] [2019-12-07 17:55:56,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:56,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:56,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:56,655 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2019-12-07 17:55:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:56,775 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2019-12-07 17:55:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:56,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-12-07 17:55:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:56,782 INFO L225 Difference]: With dead ends: 3394 [2019-12-07 17:55:56,782 INFO L226 Difference]: Without dead ends: 1678 [2019-12-07 17:55:56,783 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-12-07 17:55:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-07 17:55:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2019-12-07 17:55:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-12-07 17:55:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2019-12-07 17:55:56,824 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2019-12-07 17:55:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:56,824 INFO L462 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2019-12-07 17:55:56,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2019-12-07 17:55:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-07 17:55:56,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:56,828 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:56,828 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2019-12-07 17:55:56,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:56,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178064950] [2019-12-07 17:55:56,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 17:55:56,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178064950] [2019-12-07 17:55:56,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563258600] [2019-12-07 17:55:56,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/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-12-07 17:55:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:56,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:55:56,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 17:55:57,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:55:57,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 17:55:57,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035803574] [2019-12-07 17:55:57,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:57,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:57,009 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2019-12-07 17:55:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:57,285 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2019-12-07 17:55:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:57,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-12-07 17:55:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:57,313 INFO L225 Difference]: With dead ends: 5319 [2019-12-07 17:55:57,313 INFO L226 Difference]: Without dead ends: 3648 [2019-12-07 17:55:57,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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-12-07 17:55:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-12-07 17:55:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2019-12-07 17:55:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-12-07 17:55:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2019-12-07 17:55:57,382 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2019-12-07 17:55:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:57,382 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2019-12-07 17:55:57,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2019-12-07 17:55:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-07 17:55:57,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:57,386 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:57,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:55:57,587 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2019-12-07 17:55:57,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:57,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179764368] [2019-12-07 17:55:57,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 17:55:57,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179764368] [2019-12-07 17:55:57,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:57,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:57,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957304173] [2019-12-07 17:55:57,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:57,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:57,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:57,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:57,651 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2019-12-07 17:55:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:57,740 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2019-12-07 17:55:57,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:57,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-12-07 17:55:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:57,756 INFO L225 Difference]: With dead ends: 5741 [2019-12-07 17:55:57,756 INFO L226 Difference]: Without dead ends: 3745 [2019-12-07 17:55:57,759 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-12-07 17:55:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-12-07 17:55:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2019-12-07 17:55:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-12-07 17:55:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2019-12-07 17:55:57,847 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2019-12-07 17:55:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:57,847 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2019-12-07 17:55:57,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2019-12-07 17:55:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-12-07 17:55:57,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:57,853 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:57,853 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2019-12-07 17:55:57,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:57,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226076462] [2019-12-07 17:55:57,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-12-07 17:55:57,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226076462] [2019-12-07 17:55:57,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:57,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:57,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034034205] [2019-12-07 17:55:57,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:57,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:57,906 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2019-12-07 17:55:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:58,061 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2019-12-07 17:55:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:58,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-12-07 17:55:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:58,070 INFO L225 Difference]: With dead ends: 7697 [2019-12-07 17:55:58,071 INFO L226 Difference]: Without dead ends: 3961 [2019-12-07 17:55:58,074 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-12-07 17:55:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-12-07 17:55:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2019-12-07 17:55:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-12-07 17:55:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2019-12-07 17:55:58,169 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2019-12-07 17:55:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:58,169 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2019-12-07 17:55:58,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2019-12-07 17:55:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-12-07 17:55:58,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:58,176 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:58,177 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2019-12-07 17:55:58,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:58,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512301157] [2019-12-07 17:55:58,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-12-07 17:55:58,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512301157] [2019-12-07 17:55:58,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:58,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:58,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953426158] [2019-12-07 17:55:58,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:58,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:58,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:58,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:58,264 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2019-12-07 17:55:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:58,412 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2019-12-07 17:55:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:58,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-12-07 17:55:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:58,421 INFO L225 Difference]: With dead ends: 7611 [2019-12-07 17:55:58,421 INFO L226 Difference]: Without dead ends: 3875 [2019-12-07 17:55:58,425 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-12-07 17:55:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-12-07 17:55:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2019-12-07 17:55:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2019-12-07 17:55:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2019-12-07 17:55:58,502 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2019-12-07 17:55:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:58,502 INFO L462 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2019-12-07 17:55:58,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2019-12-07 17:55:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-12-07 17:55:58,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:58,507 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:58,507 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:58,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2019-12-07 17:55:58,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:58,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525529369] [2019-12-07 17:55:58,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-12-07 17:55:58,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525529369] [2019-12-07 17:55:58,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:58,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:58,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940927834] [2019-12-07 17:55:58,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:58,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:58,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:58,572 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2019-12-07 17:55:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:58,709 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2019-12-07 17:55:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:58,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-12-07 17:55:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:58,715 INFO L225 Difference]: With dead ends: 8043 [2019-12-07 17:55:58,715 INFO L226 Difference]: Without dead ends: 4215 [2019-12-07 17:55:58,718 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-12-07 17:55:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2019-12-07 17:55:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2019-12-07 17:55:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-12-07 17:55:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2019-12-07 17:55:58,787 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2019-12-07 17:55:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:58,788 INFO L462 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2019-12-07 17:55:58,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2019-12-07 17:55:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-12-07 17:55:58,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:58,793 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:58,793 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2019-12-07 17:55:58,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:58,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286601562] [2019-12-07 17:55:58,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-12-07 17:55:58,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286601562] [2019-12-07 17:55:58,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:58,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:58,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902760127] [2019-12-07 17:55:58,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:58,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:58,874 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2019-12-07 17:55:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:58,984 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2019-12-07 17:55:58,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:58,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-12-07 17:55:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:58,986 INFO L225 Difference]: With dead ends: 6854 [2019-12-07 17:55:58,987 INFO L226 Difference]: Without dead ends: 2132 [2019-12-07 17:55:58,990 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-12-07 17:55:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-12-07 17:55:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2019-12-07 17:55:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-12-07 17:55:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2019-12-07 17:55:59,023 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2019-12-07 17:55:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:59,023 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2019-12-07 17:55:59,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2019-12-07 17:55:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-12-07 17:55:59,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:59,026 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:59,026 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2019-12-07 17:55:59,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:59,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962904256] [2019-12-07 17:55:59,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-12-07 17:55:59,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962904256] [2019-12-07 17:55:59,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:59,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:59,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975927913] [2019-12-07 17:55:59,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:59,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:59,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:59,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:59,105 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2019-12-07 17:55:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:59,206 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2019-12-07 17:55:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:59,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-12-07 17:55:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:59,209 INFO L225 Difference]: With dead ends: 4297 [2019-12-07 17:55:59,209 INFO L226 Difference]: Without dead ends: 2172 [2019-12-07 17:55:59,211 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-12-07 17:55:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-12-07 17:55:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2019-12-07 17:55:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-12-07 17:55:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2019-12-07 17:55:59,244 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2019-12-07 17:55:59,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:59,244 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2019-12-07 17:55:59,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2019-12-07 17:55:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-12-07 17:55:59,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:59,247 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:59,247 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:59,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:59,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2019-12-07 17:55:59,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:59,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246857958] [2019-12-07 17:55:59,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-12-07 17:55:59,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246857958] [2019-12-07 17:55:59,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:59,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:59,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492690677] [2019-12-07 17:55:59,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:59,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:59,328 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2019-12-07 17:55:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:59,442 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2019-12-07 17:55:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:59,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-12-07 17:55:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:59,445 INFO L225 Difference]: With dead ends: 4267 [2019-12-07 17:55:59,445 INFO L226 Difference]: Without dead ends: 2142 [2019-12-07 17:55:59,447 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-12-07 17:55:59,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-12-07 17:55:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2019-12-07 17:55:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-12-07 17:55:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2019-12-07 17:55:59,491 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2019-12-07 17:55:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:59,492 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2019-12-07 17:55:59,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2019-12-07 17:55:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-12-07 17:55:59,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:59,496 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:59,496 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:59,496 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2019-12-07 17:55:59,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:59,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668762908] [2019-12-07 17:55:59,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-12-07 17:55:59,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668762908] [2019-12-07 17:55:59,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937318568] [2019-12-07 17:55:59,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/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-12-07 17:55:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:59,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:55:59,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:55:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-12-07 17:55:59,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:55:59,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 17:55:59,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821573732] [2019-12-07 17:55:59,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:59,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:59,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:59,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:59,807 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 3 states. [2019-12-07 17:55:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:59,843 INFO L93 Difference]: Finished difference Result 2710 states and 3447 transitions. [2019-12-07 17:55:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:59,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-12-07 17:55:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:59,846 INFO L225 Difference]: With dead ends: 2710 [2019-12-07 17:55:59,846 INFO L226 Difference]: Without dead ends: 2572 [2019-12-07 17:55:59,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 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-12-07 17:55:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-12-07 17:55:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1996. [2019-12-07 17:55:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-12-07 17:55:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2539 transitions. [2019-12-07 17:55:59,884 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2539 transitions. Word has length 392 [2019-12-07 17:55:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:59,884 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 2539 transitions. [2019-12-07 17:55:59,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2539 transitions. [2019-12-07 17:55:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-12-07 17:55:59,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:59,887 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:00,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:56:00,088 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1194864871, now seen corresponding path program 1 times [2019-12-07 17:56:00,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:00,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615442911] [2019-12-07 17:56:00,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-12-07 17:56:00,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615442911] [2019-12-07 17:56:00,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20470706] [2019-12-07 17:56:00,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:56:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:00,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:56:00,307 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:56:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-12-07 17:56:00,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:56:00,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 17:56:00,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69932193] [2019-12-07 17:56:00,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:00,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:00,387 INFO L87 Difference]: Start difference. First operand 1996 states and 2539 transitions. Second operand 4 states. [2019-12-07 17:56:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:00,614 INFO L93 Difference]: Finished difference Result 5015 states and 6403 transitions. [2019-12-07 17:56:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:56:00,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-12-07 17:56:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:00,618 INFO L225 Difference]: With dead ends: 5015 [2019-12-07 17:56:00,618 INFO L226 Difference]: Without dead ends: 2984 [2019-12-07 17:56:00,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 410 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-12-07 17:56:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2019-12-07 17:56:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2156. [2019-12-07 17:56:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-12-07 17:56:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2019-12-07 17:56:00,658 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 408 [2019-12-07 17:56:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:00,658 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2019-12-07 17:56:00,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2019-12-07 17:56:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-12-07 17:56:00,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:00,662 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:00,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:56:00,862 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2019-12-07 17:56:00,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:00,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033498344] [2019-12-07 17:56:00,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-12-07 17:56:01,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033498344] [2019-12-07 17:56:01,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:01,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:56:01,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889572457] [2019-12-07 17:56:01,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:56:01,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:56:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:56:01,035 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2019-12-07 17:56:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:01,136 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2019-12-07 17:56:01,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:56:01,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-12-07 17:56:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:01,141 INFO L225 Difference]: With dead ends: 4485 [2019-12-07 17:56:01,141 INFO L226 Difference]: Without dead ends: 2336 [2019-12-07 17:56:01,143 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-12-07 17:56:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-12-07 17:56:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2019-12-07 17:56:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-12-07 17:56:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2019-12-07 17:56:01,195 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2019-12-07 17:56:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:01,195 INFO L462 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2019-12-07 17:56:01,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:56:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2019-12-07 17:56:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-12-07 17:56:01,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:01,199 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:01,199 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2019-12-07 17:56:01,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:01,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594602180] [2019-12-07 17:56:01,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-12-07 17:56:01,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594602180] [2019-12-07 17:56:01,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:01,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:56:01,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866361472] [2019-12-07 17:56:01,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:56:01,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:56:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:56:01,349 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2019-12-07 17:56:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:01,455 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2019-12-07 17:56:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:56:01,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2019-12-07 17:56:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:01,459 INFO L225 Difference]: With dead ends: 4640 [2019-12-07 17:56:01,459 INFO L226 Difference]: Without dead ends: 2321 [2019-12-07 17:56:01,461 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-12-07 17:56:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-12-07 17:56:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2019-12-07 17:56:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-12-07 17:56:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2019-12-07 17:56:01,498 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2019-12-07 17:56:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:01,499 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2019-12-07 17:56:01,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:56:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2019-12-07 17:56:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-12-07 17:56:01,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:01,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:56:01,503 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2019-12-07 17:56:01,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:01,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107793019] [2019-12-07 17:56:01,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 17:56:01,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107793019] [2019-12-07 17:56:01,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011867210] [2019-12-07 17:56:01,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:56:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:01,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:56:01,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:56:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 17:56:01,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:56:01,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 17:56:01,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884581003] [2019-12-07 17:56:01,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:01,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:01,966 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2019-12-07 17:56:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:02,089 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2019-12-07 17:56:02,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:02,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2019-12-07 17:56:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:02,090 INFO L225 Difference]: With dead ends: 3916 [2019-12-07 17:56:02,090 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:56:02,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 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-12-07 17:56:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:56:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:56:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:56:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:56:02,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2019-12-07 17:56:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:02,093 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:56:02,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:56:02,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:56:02,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:56:02,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:56:02,972 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-12-07 17:56:03,409 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-12-07 17:56:03,713 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-12-07 17:56:03,949 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 17:56:04,177 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-12-07 17:56:04,314 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-12-07 17:56:04,426 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2019-12-07 17:56:04,600 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-12-07 17:56:06,075 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-12-07 17:56:06,264 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-07 17:56:06,500 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2019-12-07 17:56:06,630 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-12-07 17:56:06,744 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 25 [2019-12-07 17:56:06,909 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-12-07 17:56:07,074 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-12-07 17:56:07,295 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-12-07 17:56:07,504 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2019-12-07 17:56:07,739 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-12-07 17:56:11,709 WARN L192 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2019-12-07 17:56:11,863 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-07 17:56:12,012 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-07 17:56:12,194 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2019-12-07 17:56:12,371 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-07 17:56:12,373 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L242 CegarLoopResult]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2))) [2019-12-07 17:56:12,374 INFO L242 CegarLoopResult]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-12-07 17:56:12,374 INFO L249 CegarLoopResult]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-12-07 17:56:12,374 INFO L246 CegarLoopResult]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-12-07 17:56:12,375 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-12-07 17:56:12,375 INFO L242 CegarLoopResult]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 17:56:12,375 INFO L242 CegarLoopResult]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-12-07 17:56:12,375 INFO L242 CegarLoopResult]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-12-07 17:56:12,375 INFO L246 CegarLoopResult]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-12-07 17:56:12,375 INFO L242 CegarLoopResult]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 17:56:12,375 INFO L246 CegarLoopResult]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-12-07 17:56:12,375 INFO L246 CegarLoopResult]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-12-07 17:56:12,375 INFO L246 CegarLoopResult]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-12-07 17:56:12,375 INFO L246 CegarLoopResult]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-12-07 17:56:12,375 INFO L246 CegarLoopResult]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-12-07 17:56:12,376 INFO L242 CegarLoopResult]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2019-12-07 17:56:12,377 INFO L242 CegarLoopResult]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-12-07 17:56:12,377 INFO L242 CegarLoopResult]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.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 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-12-07 17:56:12,377 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-12-07 17:56:12,377 INFO L246 CegarLoopResult]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-12-07 17:56:12,377 INFO L249 CegarLoopResult]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-12-07 17:56:12,377 INFO L242 CegarLoopResult]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-12-07 17:56:12,377 INFO L246 CegarLoopResult]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-12-07 17:56:12,377 INFO L246 CegarLoopResult]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-12-07 17:56:12,377 INFO L246 CegarLoopResult]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L242 CegarLoopResult]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-12-07 17:56:12,378 INFO L242 CegarLoopResult]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0))) [2019-12-07 17:56:12,378 INFO L242 CegarLoopResult]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.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 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-12-07 17:56:12,378 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L242 CegarLoopResult]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.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 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L246 CegarLoopResult]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-12-07 17:56:12,379 INFO L242 CegarLoopResult]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 17:56:12,380 INFO L242 CegarLoopResult]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L320-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 17:56:12,380 INFO L246 CegarLoopResult]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L246 CegarLoopResult]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L246 CegarLoopResult]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L246 CegarLoopResult]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L246 CegarLoopResult]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L246 CegarLoopResult]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-12-07 17:56:12,381 INFO L242 CegarLoopResult]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse6))) [2019-12-07 17:56:12,381 INFO L242 CegarLoopResult]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 17:56:12,382 INFO L242 CegarLoopResult]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-12-07 17:56:12,382 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-12-07 17:56:12,382 INFO L246 CegarLoopResult]: For program point L487(lines 487 490) no Hoare annotation was computed. [2019-12-07 17:56:12,382 INFO L246 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-12-07 17:56:12,382 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:56:12,382 INFO L249 CegarLoopResult]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-12-07 17:56:12,382 INFO L246 CegarLoopResult]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-12-07 17:56:12,382 INFO L246 CegarLoopResult]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-12-07 17:56:12,382 INFO L246 CegarLoopResult]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-12-07 17:56:12,383 INFO L246 CegarLoopResult]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-12-07 17:56:12,384 INFO L246 CegarLoopResult]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-12-07 17:56:12,384 INFO L246 CegarLoopResult]: For program point L492(lines 492 498) no Hoare annotation was computed. [2019-12-07 17:56:12,384 INFO L242 CegarLoopResult]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not .cse4)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3))) [2019-12-07 17:56:12,384 INFO L242 CegarLoopResult]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 17:56:12,384 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-12-07 17:56:12,384 INFO L246 CegarLoopResult]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-12-07 17:56:12,384 INFO L246 CegarLoopResult]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-12-07 17:56:12,384 INFO L246 CegarLoopResult]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-12-07 17:56:12,384 INFO L246 CegarLoopResult]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-12-07 17:56:12,385 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse29 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse5 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse10)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse24 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (not .cse29)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not .cse21)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse8) (and .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse20 .cse9 .cse10) (and .cse21 .cse15 .cse10) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse22 .cse8 .cse23 .cse3) (and .cse0 .cse24 .cse25 .cse26) (and .cse27 .cse9 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (and .cse4 .cse24 .cse6) (and .cse7 .cse24) (and .cse27 .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse27 .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (and .cse0 .cse4 .cse1 .cse2) (and .cse11 .cse5 .cse13 .cse14 .cse16 .cse22 .cse6 .cse20 .cse9) (and .cse0 .cse5 .cse25 .cse26 .cse10) (and .cse7 .cse5) (and .cse4 .cse15 .cse6 .cse10) (and .cse5 .cse18 .cse26) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse22 .cse23 .cse10) (and .cse11 .cse13 .cse14 .cse24 .cse16 .cse22 .cse17 .cse6 .cse20 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse0 .cse25 .cse15 .cse26 .cse3) (and .cse5 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse15) (and .cse8 .cse18 .cse26 .cse3) (and .cse0 .cse4 .cse25 .cse15 .cse26) (and .cse24 .cse22 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse15 .cse29 .cse10)))) [2019-12-07 17:56:12,385 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-12-07 17:56:12,385 INFO L246 CegarLoopResult]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-12-07 17:56:12,385 INFO L246 CegarLoopResult]: For program point L495-2(lines 207 541) no Hoare annotation was computed. [2019-12-07 17:56:12,385 INFO L242 CegarLoopResult]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L242 CegarLoopResult]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)))) [2019-12-07 17:56:12,386 INFO L242 CegarLoopResult]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.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 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2) (and .cse3 .cse4 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse2))) [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-12-07 17:56:12,386 INFO L246 CegarLoopResult]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-12-07 17:56:12,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:56:12 BoogieIcfgContainer [2019-12-07 17:56:12,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:56:12,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:56:12,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:56:12,430 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:56:12,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:55:52" (3/4) ... [2019-12-07 17:56:12,434 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:56:12,451 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:56:12,452 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:56:12,551 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7248873-aaaa-42a6-9b57-dc960c6f3d6f/bin/uautomizer/witness.graphml [2019-12-07 17:56:12,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:56:12,552 INFO L168 Benchmark]: Toolchain (without parser) took 20759.88 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 990.4 MB). Free memory was 935.4 MB in the beginning and 1.6 GB in the end (delta: -644.9 MB). Peak memory consumption was 345.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:12,552 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:56:12,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:12,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.58 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-12-07 17:56:12,553 INFO L168 Benchmark]: Boogie Preprocessor took 24.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:12,553 INFO L168 Benchmark]: RCFGBuilder took 450.32 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:12,553 INFO L168 Benchmark]: TraceAbstraction took 19877.00 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 886.6 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -579.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:56:12,554 INFO L168 Benchmark]: Witness Printer took 120.90 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:56:12,555 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.58 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. * Boogie Preprocessor took 24.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.32 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19877.00 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 886.6 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -579.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 120.90 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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: 140]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8448) && 0 == s__hit) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && 0 == blastFlag) && s__state <= 8448)) || (((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292)) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 12292))) || ((1 == blastFlag && 8672 <= s__state) && !(s__state == 12292))) || ((8672 <= s__state && 0 == blastFlag) && !(s__state == 12292)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && 8448 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) || (((((((((!(s__state == 8544) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((!(s__state == 8544) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) || ((((((((((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) || ((((s__state <= 8672 && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && 8448 <= s__state) && s__state <= 8448) || (((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) || (((((s__state <= 8672 && !(s__state == 8656)) && 0 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && 1 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((((((((((!(s__state == 8545) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8528) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || ((s__state == 8544 && 2 == blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((((((s__state == 8592 && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || (s__state <= 3 && 0 == blastFlag)) || ((((((((((((s__state == 8592 && 1 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || ((((((((((((s__state == 8592 && 0 == blastFlag) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || ((((((((!(s__state == 8561) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((s__state <= 8672 && 1 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state) && 0 == s__hit)) || (s__state <= 3 && 1 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((1 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((((((((!(s__state == 8561) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit) && s__state == 8512)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || (s__state <= 3 && 2 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && s__state == 8608) && !(s__state == 8480))) || ((2 == blastFlag && s__state == 8560) && 0 == s__hit) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state == 8608) && 0 == s__hit) || (1 == blastFlag && s__state == 8608)) || (0 == blastFlag && s__state == 8608) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 0 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8544)) && 1 == blastFlag) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 9.7s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, HoareTripleCheckerStatistics: 6655 SDtfs, 4128 SDslu, 3144 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3545 HoareAnnotationTreeSize, 28 FomulaSimplifications, 146928 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38499 FormulaSimplificationTreeSizeReductionInter, 8.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 9209 NumberOfCodeBlocks, 9209 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9169 ConstructedInterpolants, 0 QuantifiedInterpolants, 3945115 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2970 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 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...