./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:43:15,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:43:15,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:43:15,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:43:15,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:43:15,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:43:15,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:43:15,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:43:15,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:43:15,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:43:15,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:43:15,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:43:15,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:43:15,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:43:15,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:43:15,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:43:15,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:43:15,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:43:15,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:43:15,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:43:15,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:43:15,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:43:15,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:43:15,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:43:15,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:43:15,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:43:15,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:43:15,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:43:15,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:43:15,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:43:15,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:43:15,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:43:15,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:43:15,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:43:15,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:43:15,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:43:15,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:43:15,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:43:15,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:43:15,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:43:15,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:43:15,134 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:43:15,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:43:15,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:43:15,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:43:15,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:43:15,148 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:43:15,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:43:15,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:43:15,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:43:15,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:43:15,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:43:15,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:43:15,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:43:15,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:43:15,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:43:15,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:43:15,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:43:15,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:43:15,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:43:15,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:43:15,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:43:15,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:43:15,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:43:15,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:43:15,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:43:15,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:43:15,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:43:15,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:43:15,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:43:15,152 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_44a15535-4255-4f2e-8ceb-528d6759cac9/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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-20 07:43:15,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:43:15,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:43:15,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:43:15,314 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:43:15,315 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:43:15,315 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-20 07:43:15,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/data/4d7ac7c51/97a4f5233779454f99866315f6a1bfb0/FLAGb2a2c50db [2019-11-20 07:43:15,761 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:43:15,762 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-20 07:43:15,773 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/data/4d7ac7c51/97a4f5233779454f99866315f6a1bfb0/FLAGb2a2c50db [2019-11-20 07:43:16,099 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/data/4d7ac7c51/97a4f5233779454f99866315f6a1bfb0 [2019-11-20 07:43:16,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:43:16,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:43:16,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:43:16,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:43:16,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:43:16,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528355a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16, skipping insertion in model container [2019-11-20 07:43:16,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:43:16,179 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:43:16,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:43:16,484 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:43:16,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:43:16,587 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:43:16,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16 WrapperNode [2019-11-20 07:43:16,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:43:16,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:43:16,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:43:16,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:43:16,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:43:16,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:43:16,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:43:16,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:43:16,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... [2019-11-20 07:43:16,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:43:16,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:43:16,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:43:16,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:43:16,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:43:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:43:16,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:43:16,966 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 07:43:17,694 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 07:43:17,694 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 07:43:17,696 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:43:17,696 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 07:43:17,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:43:17 BoogieIcfgContainer [2019-11-20 07:43:17,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:43:17,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:43:17,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:43:17,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:43:17,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:43:16" (1/3) ... [2019-11-20 07:43:17,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464f84f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:43:17, skipping insertion in model container [2019-11-20 07:43:17,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:43:16" (2/3) ... [2019-11-20 07:43:17,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464f84f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:43:17, skipping insertion in model container [2019-11-20 07:43:17,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:43:17" (3/3) ... [2019-11-20 07:43:17,706 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-20 07:43:17,715 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:43:17,723 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:43:17,734 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:43:17,768 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:43:17,768 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:43:17,768 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:43:17,770 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:43:17,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:43:17,772 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:43:17,772 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:43:17,772 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:43:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-20 07:43:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 07:43:17,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:17,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:17,805 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:17,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-20 07:43:17,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:17,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545757429] [2019-11-20 07:43:17,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:43:18,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545757429] [2019-11-20 07:43:18,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:18,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:18,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461778776] [2019-11-20 07:43:18,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:18,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:18,073 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-20 07:43:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:18,472 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-20 07:43:18,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:18,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 07:43:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:18,490 INFO L225 Difference]: With dead ends: 322 [2019-11-20 07:43:18,491 INFO L226 Difference]: Without dead ends: 170 [2019-11-20 07:43:18,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-20 07:43:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-20 07:43:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-20 07:43:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-20 07:43:18,545 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-20 07:43:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:18,546 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-20 07:43:18,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-20 07:43:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 07:43:18,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:18,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:18,549 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-20 07:43:18,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:18,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761432860] [2019-11-20 07:43:18,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:43:18,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761432860] [2019-11-20 07:43:18,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:18,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:18,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794293243] [2019-11-20 07:43:18,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:18,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:18,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:18,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:18,625 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-20 07:43:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:18,901 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-20 07:43:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:18,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 07:43:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:18,905 INFO L225 Difference]: With dead ends: 371 [2019-11-20 07:43:18,905 INFO L226 Difference]: Without dead ends: 211 [2019-11-20 07:43:18,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-20 07:43:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-20 07:43:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 07:43:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-20 07:43:18,938 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-20 07:43:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:18,939 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-20 07:43:18,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-20 07:43:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 07:43:18,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:18,944 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-11-20 07:43:18,944 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-20 07:43:18,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:18,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232089068] [2019-11-20 07:43:18,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:43:19,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232089068] [2019-11-20 07:43:19,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:19,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:19,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552047104] [2019-11-20 07:43:19,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:19,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:19,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:19,032 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-20 07:43:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:19,285 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-20 07:43:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:19,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 07:43:19,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:19,290 INFO L225 Difference]: With dead ends: 436 [2019-11-20 07:43:19,291 INFO L226 Difference]: Without dead ends: 237 [2019-11-20 07:43:19,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-20 07:43:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-20 07:43:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 07:43:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-20 07:43:19,329 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-20 07:43:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:19,333 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-20 07:43:19,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-20 07:43:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:43:19,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:19,337 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-11-20 07:43:19,338 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-20 07:43:19,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:19,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041987415] [2019-11-20 07:43:19,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 07:43:19,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041987415] [2019-11-20 07:43:19,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:19,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:19,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532281530] [2019-11-20 07:43:19,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:19,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:19,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:19,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:19,428 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-20 07:43:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:19,632 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-20 07:43:19,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:19,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:43:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:19,636 INFO L225 Difference]: With dead ends: 484 [2019-11-20 07:43:19,636 INFO L226 Difference]: Without dead ends: 254 [2019-11-20 07:43:19,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-20 07:43:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-20 07:43:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-20 07:43:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-20 07:43:19,661 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-20 07:43:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:19,662 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-20 07:43:19,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-20 07:43:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 07:43:19,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:19,665 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:19,665 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-20 07:43:19,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:19,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059746053] [2019-11-20 07:43:19,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:43:19,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059746053] [2019-11-20 07:43:19,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:19,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:19,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326001873] [2019-11-20 07:43:19,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:19,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:19,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:19,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:19,737 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-20 07:43:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:19,989 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-20 07:43:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:19,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 07:43:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:19,992 INFO L225 Difference]: With dead ends: 543 [2019-11-20 07:43:19,993 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 07:43:19,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 07:43:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-20 07:43:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-20 07:43:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-20 07:43:20,010 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-20 07:43:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:20,011 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-20 07:43:20,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-20 07:43:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 07:43:20,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:20,014 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-11-20 07:43:20,014 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-20 07:43:20,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:20,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358259636] [2019-11-20 07:43:20,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 07:43:20,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358259636] [2019-11-20 07:43:20,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:20,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:20,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91574229] [2019-11-20 07:43:20,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:20,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:20,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:20,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:20,097 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-20 07:43:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:20,285 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-20 07:43:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:20,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 07:43:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:20,288 INFO L225 Difference]: With dead ends: 583 [2019-11-20 07:43:20,288 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 07:43:20,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 07:43:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-20 07:43:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-20 07:43:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-20 07:43:20,302 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-20 07:43:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:20,302 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-20 07:43:20,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-20 07:43:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 07:43:20,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:20,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:20,305 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:20,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-20 07:43:20,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:20,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015454332] [2019-11-20 07:43:20,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:43:20,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015454332] [2019-11-20 07:43:20,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:20,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:20,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186536267] [2019-11-20 07:43:20,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:20,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:20,378 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-20 07:43:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:20,618 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-20 07:43:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:20,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 07:43:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:20,621 INFO L225 Difference]: With dead ends: 585 [2019-11-20 07:43:20,621 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 07:43:20,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 07:43:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-20 07:43:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-20 07:43:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-20 07:43:20,634 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-20 07:43:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:20,634 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-20 07:43:20,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-20 07:43:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 07:43:20,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:20,636 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] [2019-11-20 07:43:20,637 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:20,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-20 07:43:20,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:20,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138853858] [2019-11-20 07:43:20,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 07:43:20,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138853858] [2019-11-20 07:43:20,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:20,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:20,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438368779] [2019-11-20 07:43:20,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:20,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:20,682 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-20 07:43:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:20,815 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-20 07:43:20,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:20,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-20 07:43:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:20,818 INFO L225 Difference]: With dead ends: 585 [2019-11-20 07:43:20,818 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 07:43:20,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 07:43:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-20 07:43:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-20 07:43:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-20 07:43:20,831 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-20 07:43:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:20,832 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-20 07:43:20,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-20 07:43:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 07:43:20,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:20,834 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-11-20 07:43:20,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:20,835 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-20 07:43:20,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:20,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099930473] [2019-11-20 07:43:20,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 07:43:20,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099930473] [2019-11-20 07:43:20,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:20,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:20,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586691912] [2019-11-20 07:43:20,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:20,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:20,908 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-20 07:43:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:21,105 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-20 07:43:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:21,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 07:43:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:21,108 INFO L225 Difference]: With dead ends: 624 [2019-11-20 07:43:21,108 INFO L226 Difference]: Without dead ends: 331 [2019-11-20 07:43:21,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-20 07:43:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-20 07:43:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-20 07:43:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-20 07:43:21,122 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-20 07:43:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:21,122 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-20 07:43:21,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-20 07:43:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:43:21,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:21,124 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] [2019-11-20 07:43:21,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:21,125 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-20 07:43:21,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:21,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696657497] [2019-11-20 07:43:21,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 07:43:21,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696657497] [2019-11-20 07:43:21,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:21,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:21,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558268435] [2019-11-20 07:43:21,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:21,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:21,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,174 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-20 07:43:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:21,363 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-20 07:43:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:21,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 07:43:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:21,366 INFO L225 Difference]: With dead ends: 685 [2019-11-20 07:43:21,367 INFO L226 Difference]: Without dead ends: 363 [2019-11-20 07:43:21,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-20 07:43:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-20 07:43:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 07:43:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-20 07:43:21,384 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-20 07:43:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:21,385 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-20 07:43:21,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-20 07:43:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 07:43:21,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:21,387 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-11-20 07:43:21,387 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-20 07:43:21,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:21,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126065590] [2019-11-20 07:43:21,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 07:43:21,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126065590] [2019-11-20 07:43:21,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:21,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114801813] [2019-11-20 07:43:21,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:21,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:21,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,429 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-20 07:43:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:21,621 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-20 07:43:21,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:21,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 07:43:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:21,624 INFO L225 Difference]: With dead ends: 707 [2019-11-20 07:43:21,624 INFO L226 Difference]: Without dead ends: 358 [2019-11-20 07:43:21,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-20 07:43:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-20 07:43:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 07:43:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-20 07:43:21,640 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-20 07:43:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:21,640 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-20 07:43:21,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-20 07:43:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 07:43:21,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:21,642 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] [2019-11-20 07:43:21,643 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:21,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-20 07:43:21,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:21,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910650757] [2019-11-20 07:43:21,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 07:43:21,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910650757] [2019-11-20 07:43:21,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:21,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:21,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849610758] [2019-11-20 07:43:21,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:21,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,676 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-20 07:43:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:21,863 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-20 07:43:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:21,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 07:43:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:21,866 INFO L225 Difference]: With dead ends: 712 [2019-11-20 07:43:21,866 INFO L226 Difference]: Without dead ends: 363 [2019-11-20 07:43:21,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-20 07:43:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-20 07:43:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 07:43:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-20 07:43:21,880 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-20 07:43:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:21,881 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-20 07:43:21,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-20 07:43:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 07:43:21,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:21,883 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:21,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-20 07:43:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:21,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459045019] [2019-11-20 07:43:21,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 07:43:21,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459045019] [2019-11-20 07:43:21,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:21,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:21,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756966715] [2019-11-20 07:43:21,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:21,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:21,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:21,942 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-20 07:43:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:22,128 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-20 07:43:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:22,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 07:43:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:22,131 INFO L225 Difference]: With dead ends: 730 [2019-11-20 07:43:22,131 INFO L226 Difference]: Without dead ends: 381 [2019-11-20 07:43:22,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-20 07:43:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-20 07:43:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-20 07:43:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-20 07:43:22,151 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-20 07:43:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:22,152 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-20 07:43:22,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-20 07:43:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 07:43:22,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:22,154 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:22,155 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:22,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-20 07:43:22,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:22,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186225987] [2019-11-20 07:43:22,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 07:43:22,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186225987] [2019-11-20 07:43:22,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:22,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:22,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321866397] [2019-11-20 07:43:22,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:22,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:22,207 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-20 07:43:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:22,416 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-20 07:43:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:22,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 07:43:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:22,419 INFO L225 Difference]: With dead ends: 751 [2019-11-20 07:43:22,419 INFO L226 Difference]: Without dead ends: 381 [2019-11-20 07:43:22,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-20 07:43:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-20 07:43:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-20 07:43:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-20 07:43:22,434 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-20 07:43:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:22,434 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-20 07:43:22,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-20 07:43:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 07:43:22,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:22,437 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:22,437 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-20 07:43:22,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:22,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542002096] [2019-11-20 07:43:22,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 07:43:22,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542002096] [2019-11-20 07:43:22,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:22,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:22,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372439659] [2019-11-20 07:43:22,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:22,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:22,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:22,491 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-20 07:43:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:22,536 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-20 07:43:22,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:22,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 07:43:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:22,542 INFO L225 Difference]: With dead ends: 747 [2019-11-20 07:43:22,542 INFO L226 Difference]: Without dead ends: 745 [2019-11-20 07:43:22,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-20 07:43:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-20 07:43:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-20 07:43:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-20 07:43:22,579 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-20 07:43:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:22,580 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-20 07:43:22,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-20 07:43:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 07:43:22,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:22,582 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:22,583 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-20 07:43:22,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:22,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873134546] [2019-11-20 07:43:22,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:22,594 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 07:43:22,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268540997] [2019-11-20 07:43:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:22,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:43:22,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 07:43:22,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873134546] [2019-11-20 07:43:22,749 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 07:43:22,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268540997] [2019-11-20 07:43:22,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:22,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:43:22,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312022291] [2019-11-20 07:43:22,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:22,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:22,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:22,753 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-20 07:43:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:22,824 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-20 07:43:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:22,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 07:43:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:22,832 INFO L225 Difference]: With dead ends: 1851 [2019-11-20 07:43:22,833 INFO L226 Difference]: Without dead ends: 1113 [2019-11-20 07:43:22,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-20 07:43:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-20 07:43:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-20 07:43:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-20 07:43:22,887 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-20 07:43:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:22,888 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-20 07:43:22,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-20 07:43:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 07:43:22,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:22,892 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:23,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:23,098 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:23,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-20 07:43:23,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:23,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603269353] [2019-11-20 07:43:23,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:23,110 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 07:43:23,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608533106] [2019-11-20 07:43:23,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:23,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:43:23,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 07:43:23,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603269353] [2019-11-20 07:43:23,244 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 07:43:23,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608533106] [2019-11-20 07:43:23,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:23,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:23,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388266525] [2019-11-20 07:43:23,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:23,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:23,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:23,251 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-20 07:43:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:23,316 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-20 07:43:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:23,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-20 07:43:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:23,325 INFO L225 Difference]: With dead ends: 2219 [2019-11-20 07:43:23,326 INFO L226 Difference]: Without dead ends: 1481 [2019-11-20 07:43:23,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-20 07:43:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-20 07:43:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-20 07:43:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-20 07:43:23,385 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-20 07:43:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:23,385 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-20 07:43:23,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-20 07:43:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 07:43:23,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:23,390 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:23,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:23,593 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:23,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-20 07:43:23,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:23,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594352524] [2019-11-20 07:43:23,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-20 07:43:23,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594352524] [2019-11-20 07:43:23,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:23,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:23,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048122747] [2019-11-20 07:43:23,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:23,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:23,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:23,650 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-20 07:43:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:23,867 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-20 07:43:23,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:23,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 07:43:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:23,877 INFO L225 Difference]: With dead ends: 3059 [2019-11-20 07:43:23,877 INFO L226 Difference]: Without dead ends: 1585 [2019-11-20 07:43:23,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-20 07:43:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-20 07:43:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-20 07:43:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-20 07:43:23,944 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-20 07:43:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:23,945 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-20 07:43:23,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-20 07:43:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 07:43:23,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:23,950 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:23,950 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-20 07:43:23,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:23,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082220610] [2019-11-20 07:43:23,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:23,965 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 07:43:23,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410790407] [2019-11-20 07:43:23,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:24,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:43:24,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 07:43:24,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082220610] [2019-11-20 07:43:24,090 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 07:43:24,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410790407] [2019-11-20 07:43:24,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:24,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:24,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303425722] [2019-11-20 07:43:24,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:24,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:24,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:24,094 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-20 07:43:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:24,182 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-20 07:43:24,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:24,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 07:43:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:24,194 INFO L225 Difference]: With dead ends: 3139 [2019-11-20 07:43:24,195 INFO L226 Difference]: Without dead ends: 1964 [2019-11-20 07:43:24,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-20 07:43:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-20 07:43:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-20 07:43:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-20 07:43:24,279 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-20 07:43:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:24,280 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-20 07:43:24,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-20 07:43:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 07:43:24,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:24,287 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 07:43:24,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:24,492 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-20 07:43:24,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:24,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314646990] [2019-11-20 07:43:24,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:24,509 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 07:43:24,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369703223] [2019-11-20 07:43:24,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/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-11-20 07:43:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:24,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:43:24,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 07:43:24,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314646990] [2019-11-20 07:43:24,703 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 07:43:24,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369703223] [2019-11-20 07:43:24,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:24,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:24,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724036636] [2019-11-20 07:43:24,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:24,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:24,705 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-20 07:43:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:24,823 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-20 07:43:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:24,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-20 07:43:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:24,845 INFO L225 Difference]: With dead ends: 5743 [2019-11-20 07:43:24,845 INFO L226 Difference]: Without dead ends: 3786 [2019-11-20 07:43:24,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-20 07:43:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-20 07:43:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 07:43:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-20 07:43:24,983 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-20 07:43:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:24,984 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-20 07:43:24,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-20 07:43:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 07:43:24,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:24,995 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, 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] [2019-11-20 07:43:25,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:25,201 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-20 07:43:25,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:25,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874921899] [2019-11-20 07:43:25,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:25,212 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 07:43:25,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319114679] [2019-11-20 07:43:25,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/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-11-20 07:43:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:25,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:43:25,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 07:43:25,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874921899] [2019-11-20 07:43:25,381 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 07:43:25,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319114679] [2019-11-20 07:43:25,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:25,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:25,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234005125] [2019-11-20 07:43:25,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:25,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:25,383 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-20 07:43:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:25,691 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-20 07:43:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:25,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-20 07:43:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:25,713 INFO L225 Difference]: With dead ends: 7651 [2019-11-20 07:43:25,713 INFO L226 Difference]: Without dead ends: 3874 [2019-11-20 07:43:25,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-20 07:43:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-20 07:43:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 07:43:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-20 07:43:25,851 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-20 07:43:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:25,851 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-20 07:43:25,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-20 07:43:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-20 07:43:25,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:25,862 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 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, 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, 1, 1, 1, 1] [2019-11-20 07:43:26,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:26,066 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-20 07:43:26,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:26,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652925932] [2019-11-20 07:43:26,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-20 07:43:26,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652925932] [2019-11-20 07:43:26,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:26,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:26,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980790664] [2019-11-20 07:43:26,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:26,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:26,151 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-20 07:43:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:26,452 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-20 07:43:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:26,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-20 07:43:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:26,474 INFO L225 Difference]: With dead ends: 7683 [2019-11-20 07:43:26,474 INFO L226 Difference]: Without dead ends: 3906 [2019-11-20 07:43:26,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-20 07:43:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-20 07:43:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 07:43:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-20 07:43:26,615 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-20 07:43:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:26,615 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-20 07:43:26,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-20 07:43:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-20 07:43:26,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:26,627 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 07:43:26,627 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-20 07:43:26,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:26,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262977237] [2019-11-20 07:43:26,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:26,647 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 07:43:26,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824565950] [2019-11-20 07:43:26,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:26,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:43:26,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-20 07:43:26,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262977237] [2019-11-20 07:43:26,819 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 07:43:26,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824565950] [2019-11-20 07:43:26,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:26,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:26,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89344477] [2019-11-20 07:43:26,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:26,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:26,821 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-20 07:43:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:27,070 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-20 07:43:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:27,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-20 07:43:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:27,099 INFO L225 Difference]: With dead ends: 7561 [2019-11-20 07:43:27,106 INFO L226 Difference]: Without dead ends: 3784 [2019-11-20 07:43:27,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-20 07:43:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-20 07:43:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 07:43:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-20 07:43:27,233 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-20 07:43:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:27,234 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-20 07:43:27,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-20 07:43:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-20 07:43:27,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:27,245 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:27,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:27,450 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-20 07:43:27,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:27,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457939508] [2019-11-20 07:43:27,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:27,464 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 07:43:27,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707370504] [2019-11-20 07:43:27,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:27,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 07:43:27,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-20 07:43:27,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457939508] [2019-11-20 07:43:27,637 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 07:43:27,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707370504] [2019-11-20 07:43:27,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:27,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:27,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287375763] [2019-11-20 07:43:27,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:27,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:27,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:27,640 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-20 07:43:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:27,910 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-20 07:43:27,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:27,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-20 07:43:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:27,916 INFO L225 Difference]: With dead ends: 7951 [2019-11-20 07:43:27,917 INFO L226 Difference]: Without dead ends: 2307 [2019-11-20 07:43:27,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-20 07:43:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-20 07:43:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-20 07:43:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-20 07:43:28,043 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-20 07:43:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:28,044 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-20 07:43:28,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-20 07:43:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-20 07:43:28,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:28,052 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:28,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:28,252 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-20 07:43:28,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:28,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387164373] [2019-11-20 07:43:28,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-20 07:43:28,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387164373] [2019-11-20 07:43:28,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:28,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:28,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701682821] [2019-11-20 07:43:28,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:28,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:28,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:28,367 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-20 07:43:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:28,542 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-20 07:43:28,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:28,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-20 07:43:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:28,548 INFO L225 Difference]: With dead ends: 4829 [2019-11-20 07:43:28,548 INFO L226 Difference]: Without dead ends: 2529 [2019-11-20 07:43:28,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-20 07:43:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-20 07:43:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-20 07:43:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-20 07:43:28,615 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-20 07:43:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:28,616 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-20 07:43:28,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-20 07:43:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-20 07:43:28,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:28,625 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:28,626 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-20 07:43:28,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:28,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753534558] [2019-11-20 07:43:28,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-20 07:43:28,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753534558] [2019-11-20 07:43:28,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:28,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:28,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103035560] [2019-11-20 07:43:28,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:28,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:28,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:28,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:28,751 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-20 07:43:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:28,958 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-20 07:43:28,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:28,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-20 07:43:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:28,963 INFO L225 Difference]: With dead ends: 4949 [2019-11-20 07:43:28,963 INFO L226 Difference]: Without dead ends: 2499 [2019-11-20 07:43:28,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-20 07:43:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-20 07:43:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-20 07:43:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-20 07:43:29,028 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-20 07:43:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:29,028 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-20 07:43:29,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-20 07:43:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-20 07:43:29,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:29,038 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:29,039 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:29,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:29,040 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-20 07:43:29,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:29,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974831457] [2019-11-20 07:43:29,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-20 07:43:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974831457] [2019-11-20 07:43:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086532244] [2019-11-20 07:43:29,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:29,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:43:29,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-20 07:43:29,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:43:29,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 07:43:29,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849562276] [2019-11-20 07:43:29,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:43:29,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:29,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:43:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:43:29,446 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-20 07:43:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:29,855 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-11-20 07:43:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:43:29,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-20 07:43:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:29,862 INFO L225 Difference]: With dead ends: 6557 [2019-11-20 07:43:29,862 INFO L226 Difference]: Without dead ends: 3975 [2019-11-20 07:43:29,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:43:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-11-20 07:43:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-11-20 07:43:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-20 07:43:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-20 07:43:29,939 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-20 07:43:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:29,940 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-20 07:43:29,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:43:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-20 07:43:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-20 07:43:29,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:29,951 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:43:30,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:30,156 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-20 07:43:30,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:30,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578642381] [2019-11-20 07:43:30,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-20 07:43:30,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578642381] [2019-11-20 07:43:30,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:30,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:30,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069632813] [2019-11-20 07:43:30,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:30,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:30,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:30,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:30,330 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-20 07:43:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:30,559 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-20 07:43:30,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:30,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-20 07:43:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:30,564 INFO L225 Difference]: With dead ends: 5073 [2019-11-20 07:43:30,565 INFO L226 Difference]: Without dead ends: 2546 [2019-11-20 07:43:30,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-20 07:43:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-20 07:43:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-20 07:43:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-20 07:43:30,649 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-20 07:43:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:30,649 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-20 07:43:30,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-20 07:43:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-20 07:43:30,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:30,665 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] [2019-11-20 07:43:30,666 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-20 07:43:30,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:30,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287632761] [2019-11-20 07:43:30,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-20 07:43:30,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287632761] [2019-11-20 07:43:30,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:30,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:30,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578366521] [2019-11-20 07:43:30,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:30,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:30,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:30,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:30,904 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-20 07:43:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:31,105 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-20 07:43:31,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:31,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-20 07:43:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:31,110 INFO L225 Difference]: With dead ends: 5277 [2019-11-20 07:43:31,110 INFO L226 Difference]: Without dead ends: 2750 [2019-11-20 07:43:31,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-20 07:43:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-20 07:43:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-20 07:43:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-20 07:43:31,182 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-20 07:43:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:31,183 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-20 07:43:31,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-20 07:43:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-20 07:43:31,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:31,191 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] [2019-11-20 07:43:31,191 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:31,192 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-20 07:43:31,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:31,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448611590] [2019-11-20 07:43:31,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-20 07:43:31,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448611590] [2019-11-20 07:43:31,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:43:31,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 07:43:31,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001828548] [2019-11-20 07:43:31,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:43:31,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:43:31,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:31,431 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-20 07:43:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:31,656 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-20 07:43:31,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:43:31,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-20 07:43:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:31,661 INFO L225 Difference]: With dead ends: 5697 [2019-11-20 07:43:31,662 INFO L226 Difference]: Without dead ends: 2966 [2019-11-20 07:43:31,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:43:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-20 07:43:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-20 07:43:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-20 07:43:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-20 07:43:31,770 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-20 07:43:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:31,771 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-20 07:43:31,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:43:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-20 07:43:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-20 07:43:31,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:43:31,780 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] [2019-11-20 07:43:31,780 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:43:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:43:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-20 07:43:31,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:43:31,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309101137] [2019-11-20 07:43:31,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:43:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-20 07:43:32,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309101137] [2019-11-20 07:43:32,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531561848] [2019-11-20 07:43:32,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:43:32,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:43:32,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:43:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-20 07:43:32,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:43:32,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 07:43:32,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560550417] [2019-11-20 07:43:32,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:43:32,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:43:32,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:43:32,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:43:32,561 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-20 07:43:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:43:32,780 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-20 07:43:32,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:43:32,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-20 07:43:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:43:32,782 INFO L225 Difference]: With dead ends: 4704 [2019-11-20 07:43:32,782 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 07:43:32,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:43:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 07:43:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 07:43:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 07:43:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 07:43:32,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-20 07:43:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:43:32,788 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:43:32,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:43:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 07:43:32,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 07:43:32,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:43:32,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 07:43:33,627 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-20 07:43:33,816 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-20 07:43:34,152 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-20 07:43:34,361 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-20 07:43:34,672 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-20 07:43:34,921 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-20 07:43:35,181 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-20 07:43:35,451 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-20 07:43:35,731 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-20 07:43:36,039 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-20 07:43:36,263 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-20 07:43:36,476 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-20 07:43:36,672 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-20 07:43:36,933 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-20 07:43:37,211 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-20 07:43:37,379 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-20 07:43:37,692 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-20 07:43:37,902 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-20 07:43:38,260 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-20 07:43:38,387 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-20 07:43:38,553 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-20 07:43:38,556 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-20 07:43:38,556 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-20 07:43:38,556 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-20 07:43:38,557 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-20 07:43:38,557 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-20 07:43:38,557 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-20 07:43:38,557 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-20 07:43:38,557 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 624) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-20 07:43:38,557 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-20 07:43:38,557 INFO L444 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 07:43:38,557 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-20 07:43:38,558 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-20 07:43:38,558 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-20 07:43:38,558 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-20 07:43:38,558 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-20 07:43:38,558 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 07:43:38,558 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,558 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-20 07:43:38,559 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-20 07:43:38,560 INFO L447 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-20 07:43:38,560 INFO L440 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 07:43:38,560 INFO L447 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-20 07:43:38,560 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-20 07:43:38,561 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-20 07:43:38,561 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-20 07:43:38,561 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-20 07:43:38,561 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,561 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,561 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-20 07:43:38,561 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-11-20 07:43:38,562 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-20 07:43:38,563 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-20 07:43:38,563 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-20 07:43:38,563 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-20 07:43:38,563 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-20 07:43:38,563 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-20 07:43:38,564 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-20 07:43:38,564 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-20 07:43:38,564 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-20 07:43:38,564 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-20 07:43:38,564 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-20 07:43:38,564 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-20 07:43:38,564 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-20 07:43:38,565 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-20 07:43:38,565 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-20 07:43:38,565 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-20 07:43:38,565 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,565 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 609) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,566 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 07:43:38,566 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 07:43:38,566 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-20 07:43:38,566 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-20 07:43:38,566 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-20 07:43:38,566 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-20 07:43:38,566 INFO L440 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: false [2019-11-20 07:43:38,567 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-20 07:43:38,567 INFO L444 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-20 07:43:38,567 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 07:43:38,567 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-20 07:43:38,567 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-20 07:43:38,567 INFO L447 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-20 07:43:38,568 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-20 07:43:38,568 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-20 07:43:38,568 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-20 07:43:38,568 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-20 07:43:38,568 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-20 07:43:38,568 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-20 07:43:38,568 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-20 07:43:38,569 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 07:43:38,569 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 07:43:38,569 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,569 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 07:43:38,569 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 617) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 07:43:38,570 INFO L440 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-20 07:43:38,570 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-20 07:43:38,570 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-20 07:43:38,570 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-20 07:43:38,570 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-20 07:43:38,571 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 07:43:38,572 INFO L447 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-20 07:43:38,572 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-20 07:43:38,572 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-20 07:43:38,572 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-20 07:43:38,572 INFO L444 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-20 07:43:38,572 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-20 07:43:38,573 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-20 07:43:38,573 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,573 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 07:43:38,573 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-20 07:43:38,573 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-20 07:43:38,573 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-20 07:43:38,574 INFO L444 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-20 07:43:38,574 INFO L444 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 07:43:38,574 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-20 07:43:38,574 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-11-20 07:43:38,574 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-20 07:43:38,574 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-20 07:43:38,575 INFO L444 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-20 07:43:38,575 INFO L444 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-20 07:43:38,575 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-20 07:43:38,575 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-20 07:43:38,575 INFO L440 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,575 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-20 07:43:38,575 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-20 07:43:38,576 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-20 07:43:38,576 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-20 07:43:38,576 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-20 07:43:38,576 INFO L440 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 07:43:38,577 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,577 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 07:43:38,577 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 07:43:38,577 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-20 07:43:38,577 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-20 07:43:38,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:43:38 BoogieIcfgContainer [2019-11-20 07:43:38,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:43:38,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:43:38,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:43:38,650 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:43:38,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:43:17" (3/4) ... [2019-11-20 07:43:38,654 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 07:43:38,680 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 07:43:38,681 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 07:43:38,855 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_44a15535-4255-4f2e-8ceb-528d6759cac9/bin/uautomizer/witness.graphml [2019-11-20 07:43:38,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:43:38,856 INFO L168 Benchmark]: Toolchain (without parser) took 22752.61 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 962.1 MB). Free memory was 944.8 MB in the beginning and 1.9 GB in the end (delta: -912.8 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:43:38,857 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:43:38,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:43:38,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:43:38,858 INFO L168 Benchmark]: Boogie Preprocessor took 41.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:43:38,858 INFO L168 Benchmark]: RCFGBuilder took 1013.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:43:38,859 INFO L168 Benchmark]: TraceAbstraction took 20950.16 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 822.1 MB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -797.5 MB). Peak memory consumption was 874.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:43:38,859 INFO L168 Benchmark]: Witness Printer took 206.02 ms. Allocated memory is still 2.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-11-20 07:43:38,861 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 482.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1013.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20950.16 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 822.1 MB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -797.5 MB). Peak memory consumption was 874.9 MB. Max. memory is 11.5 GB. * Witness Printer took 206.02 ms. Allocated memory is still 2.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(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 <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) || ((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8497)) && !(s__state == 8496)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(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 == 8480)) && !(0 == s__hit)) || (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && !(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 == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 20.8s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1911 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40537 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6399 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 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...