./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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 96aededabe895f84f71d6d614ed1af512bf7353b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:40,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:40,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:40,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:40,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:40,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:40,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:40,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:40,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:40,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:40,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:40,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:40,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:40,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:40,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:40,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:40,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:40,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:40,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:40,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:40,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:40,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:40,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:40,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:40,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:40,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:40,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:40,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:40,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:40,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:40,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:40,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:40,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:40,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:40,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:40,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:40,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:40,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:40,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:40,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:40,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:40,683 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:54:40,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:40,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:40,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:40,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:40,695 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:40,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:40,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:40,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:40,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:40,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:40,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:40,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:40,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:40,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:40,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:40,697 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:40,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:40,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:40,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:40,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:40,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:40,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:40,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:40,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:40,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:40,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:40,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:40,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:40,700 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/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-10-22 08:54:40,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:40,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:40,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:40,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:40,749 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:40,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 08:54:40,798 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/data/e078bf630/7c9a348635db4479b324b01d710d1f2a/FLAGb8eacb9ea [2019-10-22 08:54:41,181 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:41,184 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 08:54:41,193 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/data/e078bf630/7c9a348635db4479b324b01d710d1f2a/FLAGb8eacb9ea [2019-10-22 08:54:41,206 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/data/e078bf630/7c9a348635db4479b324b01d710d1f2a [2019-10-22 08:54:41,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:41,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:41,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:41,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:41,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:41,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516031e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41, skipping insertion in model container [2019-10-22 08:54:41,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,230 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:41,269 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:41,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:41,527 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:41,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:41,591 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:41,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41 WrapperNode [2019-10-22 08:54:41,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:41,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:41,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:41,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:41,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:41,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:41,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:41,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:41,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... [2019-10-22 08:54:41,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:41,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:41,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:41,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:41,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:41,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:41,856 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:54:42,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 08:54:42,342 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 08:54:42,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:42,343 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:54:42,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:42 BoogieIcfgContainer [2019-10-22 08:54:42,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:42,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:42,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:42,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:42,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:41" (1/3) ... [2019-10-22 08:54:42,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23db1563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:42, skipping insertion in model container [2019-10-22 08:54:42,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:41" (2/3) ... [2019-10-22 08:54:42,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23db1563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:42, skipping insertion in model container [2019-10-22 08:54:42,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:42" (3/3) ... [2019-10-22 08:54:42,352 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 08:54:42,360 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:42,367 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:54:42,374 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:54:42,395 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:42,395 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:42,396 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:42,396 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:42,396 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:42,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:42,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:42,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-10-22 08:54:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 08:54:42,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:42,420 INFO L380 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-10-22 08:54:42,422 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-10-22 08:54:42,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:42,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125652244] [2019-10-22 08:54:42,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:42,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125652244] [2019-10-22 08:54:42,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:42,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:42,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759194000] [2019-10-22 08:54:42,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:42,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:42,644 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-10-22 08:54:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:42,936 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-10-22 08:54:42,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:42,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 08:54:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:42,949 INFO L225 Difference]: With dead ends: 322 [2019-10-22 08:54:42,949 INFO L226 Difference]: Without dead ends: 170 [2019-10-22 08:54:42,953 INFO L600 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-10-22 08:54:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-22 08:54:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-10-22 08:54:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 08:54:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-10-22 08:54:43,017 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-10-22 08:54:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:43,018 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-10-22 08:54:43,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-10-22 08:54:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 08:54:43,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:43,020 INFO L380 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-10-22 08:54:43,020 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-10-22 08:54:43,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:43,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987961333] [2019-10-22 08:54:43,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:43,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987961333] [2019-10-22 08:54:43,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:43,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:43,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088096589] [2019-10-22 08:54:43,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:43,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:43,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:43,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:43,123 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-10-22 08:54:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:43,355 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-10-22 08:54:43,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:43,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 08:54:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:43,358 INFO L225 Difference]: With dead ends: 371 [2019-10-22 08:54:43,358 INFO L226 Difference]: Without dead ends: 211 [2019-10-22 08:54:43,359 INFO L600 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-10-22 08:54:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-22 08:54:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-10-22 08:54:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 08:54:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-10-22 08:54:43,376 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-10-22 08:54:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:43,377 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-10-22 08:54:43,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-10-22 08:54:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 08:54:43,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:43,379 INFO L380 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-10-22 08:54:43,379 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:43,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:43,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-10-22 08:54:43,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:43,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778936897] [2019-10-22 08:54:43,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:43,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778936897] [2019-10-22 08:54:43,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:43,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:43,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321214190] [2019-10-22 08:54:43,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:43,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:43,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:43,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:43,476 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-10-22 08:54:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:43,655 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-10-22 08:54:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:43,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 08:54:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:43,658 INFO L225 Difference]: With dead ends: 436 [2019-10-22 08:54:43,658 INFO L226 Difference]: Without dead ends: 237 [2019-10-22 08:54:43,659 INFO L600 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-10-22 08:54:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-22 08:54:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-10-22 08:54:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-22 08:54:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-10-22 08:54:43,677 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-10-22 08:54:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:43,678 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-10-22 08:54:43,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-10-22 08:54:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 08:54:43,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:43,681 INFO L380 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-10-22 08:54:43,681 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:43,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:43,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-10-22 08:54:43,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:43,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561976177] [2019-10-22 08:54:43,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:43,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561976177] [2019-10-22 08:54:43,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:43,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:43,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638102378] [2019-10-22 08:54:43,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:43,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:43,750 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-10-22 08:54:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:43,905 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-10-22 08:54:43,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:43,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 08:54:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:43,907 INFO L225 Difference]: With dead ends: 484 [2019-10-22 08:54:43,907 INFO L226 Difference]: Without dead ends: 254 [2019-10-22 08:54:43,908 INFO L600 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-10-22 08:54:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-22 08:54:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-10-22 08:54:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 08:54:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-10-22 08:54:43,938 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-10-22 08:54:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:43,939 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-10-22 08:54:43,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-10-22 08:54:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 08:54:43,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:43,942 INFO L380 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-10-22 08:54:43,942 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:43,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-10-22 08:54:43,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:43,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27327785] [2019-10-22 08:54:43,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:43,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:44,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27327785] [2019-10-22 08:54:44,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:44,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:44,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388254817] [2019-10-22 08:54:44,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:44,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:44,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:44,050 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-10-22 08:54:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:44,216 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-10-22 08:54:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:44,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 08:54:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:44,218 INFO L225 Difference]: With dead ends: 543 [2019-10-22 08:54:44,218 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 08:54:44,219 INFO L600 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-10-22 08:54:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 08:54:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-10-22 08:54:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-22 08:54:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-10-22 08:54:44,231 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-10-22 08:54:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:44,232 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-10-22 08:54:44,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-10-22 08:54:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:44,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:44,234 INFO L380 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-10-22 08:54:44,234 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:44,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:44,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-10-22 08:54:44,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:44,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837944089] [2019-10-22 08:54:44,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:44,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837944089] [2019-10-22 08:54:44,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:44,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:44,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153167163] [2019-10-22 08:54:44,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:44,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:44,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:44,282 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-10-22 08:54:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:44,406 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-10-22 08:54:44,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:44,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 08:54:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:44,408 INFO L225 Difference]: With dead ends: 583 [2019-10-22 08:54:44,409 INFO L226 Difference]: Without dead ends: 296 [2019-10-22 08:54:44,409 INFO L600 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-10-22 08:54:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-22 08:54:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-10-22 08:54:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-22 08:54:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-10-22 08:54:44,438 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-10-22 08:54:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:44,438 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-10-22 08:54:44,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-10-22 08:54:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:44,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:44,440 INFO L380 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-10-22 08:54:44,440 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:44,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-10-22 08:54:44,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:44,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938837795] [2019-10-22 08:54:44,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:44,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938837795] [2019-10-22 08:54:44,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:44,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:44,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422309233] [2019-10-22 08:54:44,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:44,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:44,505 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-10-22 08:54:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:44,683 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-10-22 08:54:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:44,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 08:54:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:44,685 INFO L225 Difference]: With dead ends: 585 [2019-10-22 08:54:44,685 INFO L226 Difference]: Without dead ends: 296 [2019-10-22 08:54:44,686 INFO L600 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-10-22 08:54:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-22 08:54:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-10-22 08:54:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-22 08:54:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-10-22 08:54:44,700 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-10-22 08:54:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:44,700 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-10-22 08:54:44,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-10-22 08:54:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-22 08:54:44,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:44,702 INFO L380 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-10-22 08:54:44,702 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:44,704 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-10-22 08:54:44,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:44,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939532073] [2019-10-22 08:54:44,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 08:54:44,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939532073] [2019-10-22 08:54:44,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:44,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:44,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516400872] [2019-10-22 08:54:44,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:44,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:44,749 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-10-22 08:54:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:44,856 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-10-22 08:54:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:44,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-10-22 08:54:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:44,858 INFO L225 Difference]: With dead ends: 585 [2019-10-22 08:54:44,858 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 08:54:44,859 INFO L600 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-10-22 08:54:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 08:54:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-10-22 08:54:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-22 08:54:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-10-22 08:54:44,872 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-10-22 08:54:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:44,872 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-10-22 08:54:44,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-10-22 08:54:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 08:54:44,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:44,873 INFO L380 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-10-22 08:54:44,874 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-10-22 08:54:44,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:44,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901927617] [2019-10-22 08:54:44,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:44,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:44,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901927617] [2019-10-22 08:54:44,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:44,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:44,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588666236] [2019-10-22 08:54:44,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:44,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:44,938 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-10-22 08:54:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,067 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-10-22 08:54:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:45,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 08:54:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:45,069 INFO L225 Difference]: With dead ends: 624 [2019-10-22 08:54:45,069 INFO L226 Difference]: Without dead ends: 331 [2019-10-22 08:54:45,069 INFO L600 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-10-22 08:54:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-10-22 08:54:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-10-22 08:54:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 08:54:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-10-22 08:54:45,081 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-10-22 08:54:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:45,081 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-10-22 08:54:45,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-10-22 08:54:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:54:45,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:45,086 INFO L380 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-10-22 08:54:45,086 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-10-22 08:54:45,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71580004] [2019-10-22 08:54:45,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:45,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71580004] [2019-10-22 08:54:45,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:45,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:45,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429738836] [2019-10-22 08:54:45,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:45,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:45,128 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-10-22 08:54:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,270 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-10-22 08:54:45,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:45,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 08:54:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:45,272 INFO L225 Difference]: With dead ends: 685 [2019-10-22 08:54:45,272 INFO L226 Difference]: Without dead ends: 363 [2019-10-22 08:54:45,273 INFO L600 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-10-22 08:54:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-22 08:54:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-10-22 08:54:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 08:54:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-10-22 08:54:45,284 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-10-22 08:54:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:45,284 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-10-22 08:54:45,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-10-22 08:54:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:54:45,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:45,285 INFO L380 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-10-22 08:54:45,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-10-22 08:54:45,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374245460] [2019-10-22 08:54:45,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:45,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374245460] [2019-10-22 08:54:45,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:45,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:45,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516374963] [2019-10-22 08:54:45,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:45,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:45,314 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-10-22 08:54:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,458 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-10-22 08:54:45,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:45,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 08:54:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:45,460 INFO L225 Difference]: With dead ends: 707 [2019-10-22 08:54:45,460 INFO L226 Difference]: Without dead ends: 358 [2019-10-22 08:54:45,461 INFO L600 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-10-22 08:54:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-10-22 08:54:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-10-22 08:54:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 08:54:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-10-22 08:54:45,472 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-10-22 08:54:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:45,472 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-10-22 08:54:45,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-10-22 08:54:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:54:45,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:45,474 INFO L380 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-10-22 08:54:45,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:45,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-10-22 08:54:45,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543296125] [2019-10-22 08:54:45,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:54:45,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543296125] [2019-10-22 08:54:45,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:45,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:45,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374844223] [2019-10-22 08:54:45,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:45,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:45,503 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-10-22 08:54:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,625 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-10-22 08:54:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:45,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 08:54:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:45,628 INFO L225 Difference]: With dead ends: 712 [2019-10-22 08:54:45,628 INFO L226 Difference]: Without dead ends: 363 [2019-10-22 08:54:45,628 INFO L600 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-10-22 08:54:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-22 08:54:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-10-22 08:54:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 08:54:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-10-22 08:54:45,640 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-10-22 08:54:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:45,640 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-10-22 08:54:45,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-10-22 08:54:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 08:54:45,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:45,641 INFO L380 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-10-22 08:54:45,641 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-10-22 08:54:45,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107631211] [2019-10-22 08:54:45,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:54:45,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107631211] [2019-10-22 08:54:45,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:45,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:45,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638834618] [2019-10-22 08:54:45,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:45,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:45,669 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-10-22 08:54:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,778 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-10-22 08:54:45,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:45,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 08:54:45,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:45,780 INFO L225 Difference]: With dead ends: 730 [2019-10-22 08:54:45,780 INFO L226 Difference]: Without dead ends: 381 [2019-10-22 08:54:45,781 INFO L600 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-10-22 08:54:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-22 08:54:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-10-22 08:54:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-22 08:54:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-10-22 08:54:45,793 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-10-22 08:54:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:45,793 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-10-22 08:54:45,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-10-22 08:54:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 08:54:45,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:45,794 INFO L380 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-10-22 08:54:45,794 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-10-22 08:54:45,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326540142] [2019-10-22 08:54:45,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:54:45,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326540142] [2019-10-22 08:54:45,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:45,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:45,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853503227] [2019-10-22 08:54:45,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:45,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:45,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:45,820 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-10-22 08:54:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:45,926 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-10-22 08:54:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:45,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 08:54:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:45,927 INFO L225 Difference]: With dead ends: 751 [2019-10-22 08:54:45,928 INFO L226 Difference]: Without dead ends: 381 [2019-10-22 08:54:45,928 INFO L600 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-10-22 08:54:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-22 08:54:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-10-22 08:54:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-22 08:54:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-10-22 08:54:45,940 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-10-22 08:54:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:45,940 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-10-22 08:54:45,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-10-22 08:54:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-22 08:54:45,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:45,942 INFO L380 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-10-22 08:54:45,942 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-10-22 08:54:45,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:45,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488352406] [2019-10-22 08:54:45,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:45,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 08:54:45,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488352406] [2019-10-22 08:54:45,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:45,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:45,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710444412] [2019-10-22 08:54:45,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:45,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:45,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:45,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:45,979 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-10-22 08:54:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:46,015 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-10-22 08:54:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:46,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-22 08:54:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:46,018 INFO L225 Difference]: With dead ends: 747 [2019-10-22 08:54:46,018 INFO L226 Difference]: Without dead ends: 745 [2019-10-22 08:54:46,022 INFO L600 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-10-22 08:54:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-10-22 08:54:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-10-22 08:54:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-10-22 08:54:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-10-22 08:54:46,043 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-10-22 08:54:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:46,043 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-10-22 08:54:46,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-10-22 08:54:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 08:54:46,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:46,045 INFO L380 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-10-22 08:54:46,045 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-10-22 08:54:46,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462718673] [2019-10-22 08:54:46,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,053 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:46,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430251893] [2019-10-22 08:54:46,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:54:46,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462718673] [2019-10-22 08:54:46,180 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:46,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430251893] [2019-10-22 08:54:46,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:46,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:46,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939283600] [2019-10-22 08:54:46,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:46,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:46,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:46,181 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-10-22 08:54:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:46,231 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-10-22 08:54:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:46,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-22 08:54:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:46,235 INFO L225 Difference]: With dead ends: 1851 [2019-10-22 08:54:46,235 INFO L226 Difference]: Without dead ends: 1113 [2019-10-22 08:54:46,237 INFO L600 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-10-22 08:54:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-10-22 08:54:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-10-22 08:54:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-10-22 08:54:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-10-22 08:54:46,277 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-10-22 08:54:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:46,277 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-10-22 08:54:46,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-10-22 08:54:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-22 08:54:46,280 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:46,280 INFO L380 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-10-22 08:54:46,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:46,481 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-10-22 08:54:46,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067719531] [2019-10-22 08:54:46,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,489 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:46,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099835067] [2019-10-22 08:54:46,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:46,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 08:54:46,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067719531] [2019-10-22 08:54:46,583 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:46,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099835067] [2019-10-22 08:54:46,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:46,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:46,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416684773] [2019-10-22 08:54:46,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:46,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:46,585 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-10-22 08:54:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:46,636 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-10-22 08:54:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:46,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-22 08:54:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:46,642 INFO L225 Difference]: With dead ends: 2219 [2019-10-22 08:54:46,642 INFO L226 Difference]: Without dead ends: 1481 [2019-10-22 08:54:46,643 INFO L600 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-10-22 08:54:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-10-22 08:54:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-10-22 08:54:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-10-22 08:54:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-10-22 08:54:46,690 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-10-22 08:54:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:46,691 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-10-22 08:54:46,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-10-22 08:54:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-22 08:54:46,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:46,694 INFO L380 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-10-22 08:54:46,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:46,895 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-10-22 08:54:46,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:46,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710913962] [2019-10-22 08:54:46,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:46,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-22 08:54:46,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710913962] [2019-10-22 08:54:46,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:46,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:46,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805188631] [2019-10-22 08:54:46,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:46,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:46,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:46,953 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-10-22 08:54:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,114 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-10-22 08:54:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:47,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-22 08:54:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,120 INFO L225 Difference]: With dead ends: 3059 [2019-10-22 08:54:47,120 INFO L226 Difference]: Without dead ends: 1585 [2019-10-22 08:54:47,121 INFO L600 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-10-22 08:54:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-22 08:54:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-10-22 08:54:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-10-22 08:54:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-10-22 08:54:47,171 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-10-22 08:54:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,172 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-10-22 08:54:47,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-10-22 08:54:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-22 08:54:47,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,175 INFO L380 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-10-22 08:54:47,176 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-10-22 08:54:47,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123416996] [2019-10-22 08:54:47,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,188 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:47,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359140186] [2019-10-22 08:54:47,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 08:54:47,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123416996] [2019-10-22 08:54:47,282 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:47,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359140186] [2019-10-22 08:54:47,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:47,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576992542] [2019-10-22 08:54:47,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:47,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,283 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-10-22 08:54:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,348 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-10-22 08:54:47,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:47,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-22 08:54:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,355 INFO L225 Difference]: With dead ends: 3139 [2019-10-22 08:54:47,355 INFO L226 Difference]: Without dead ends: 1964 [2019-10-22 08:54:47,357 INFO L600 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-10-22 08:54:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-10-22 08:54:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-10-22 08:54:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-10-22 08:54:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-10-22 08:54:47,443 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-10-22 08:54:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:47,443 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-10-22 08:54:47,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-10-22 08:54:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-22 08:54:47,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:47,448 INFO L380 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-10-22 08:54:47,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:47,648 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-10-22 08:54:47,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:47,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373953358] [2019-10-22 08:54:47,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:47,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:47,663 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:47,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427774038] [2019-10-22 08:54:47,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:47,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:47,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-22 08:54:47,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373953358] [2019-10-22 08:54:47,788 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:47,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427774038] [2019-10-22 08:54:47,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:47,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:47,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640793463] [2019-10-22 08:54:47,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:47,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:47,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:47,790 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-10-22 08:54:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:47,881 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-10-22 08:54:47,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:47,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-22 08:54:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:47,893 INFO L225 Difference]: With dead ends: 5743 [2019-10-22 08:54:47,894 INFO L226 Difference]: Without dead ends: 3786 [2019-10-22 08:54:47,896 INFO L600 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-10-22 08:54:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-10-22 08:54:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-10-22 08:54:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:54:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-10-22 08:54:48,008 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-10-22 08:54:48,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,008 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-10-22 08:54:48,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-10-22 08:54:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-22 08:54:48,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,016 INFO L380 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-10-22 08:54:48,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:48,217 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-10-22 08:54:48,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007978124] [2019-10-22 08:54:48,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,228 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:48,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196818168] [2019-10-22 08:54:48,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:48,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-22 08:54:48,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007978124] [2019-10-22 08:54:48,348 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:48,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196818168] [2019-10-22 08:54:48,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:48,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653447294] [2019-10-22 08:54:48,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:48,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:48,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:48,350 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-10-22 08:54:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,594 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-10-22 08:54:48,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:48,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-22 08:54:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,607 INFO L225 Difference]: With dead ends: 7651 [2019-10-22 08:54:48,607 INFO L226 Difference]: Without dead ends: 3874 [2019-10-22 08:54:48,612 INFO L600 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-10-22 08:54:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-10-22 08:54:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-10-22 08:54:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:54:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-10-22 08:54:48,785 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-10-22 08:54:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,785 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-10-22 08:54:48,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-10-22 08:54:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-22 08:54:48,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,793 INFO L380 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-10-22 08:54:48,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:48,994 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-10-22 08:54:48,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465653899] [2019-10-22 08:54:48,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-10-22 08:54:49,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465653899] [2019-10-22 08:54:49,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134639288] [2019-10-22 08:54:49,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:49,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,065 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-10-22 08:54:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,313 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-10-22 08:54:49,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-10-22 08:54:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,327 INFO L225 Difference]: With dead ends: 7683 [2019-10-22 08:54:49,327 INFO L226 Difference]: Without dead ends: 3906 [2019-10-22 08:54:49,331 INFO L600 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-10-22 08:54:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-10-22 08:54:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-10-22 08:54:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:54:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-10-22 08:54:49,455 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-10-22 08:54:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,455 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-10-22 08:54:49,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-10-22 08:54:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-22 08:54:49,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,463 INFO L380 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-10-22 08:54:49,463 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-10-22 08:54:49,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743896826] [2019-10-22 08:54:49,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,476 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:49,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140895150] [2019-10-22 08:54:49,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-22 08:54:49,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743896826] [2019-10-22 08:54:49,602 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:49,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140895150] [2019-10-22 08:54:49,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079182107] [2019-10-22 08:54:49,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:49,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,603 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-10-22 08:54:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,830 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-10-22 08:54:49,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-10-22 08:54:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,855 INFO L225 Difference]: With dead ends: 7561 [2019-10-22 08:54:49,855 INFO L226 Difference]: Without dead ends: 3784 [2019-10-22 08:54:49,863 INFO L600 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-10-22 08:54:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-10-22 08:54:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-10-22 08:54:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-22 08:54:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-10-22 08:54:49,972 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-10-22 08:54:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,972 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-10-22 08:54:49,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-10-22 08:54:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-22 08:54:49,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,980 INFO L380 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-10-22 08:54:50,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,181 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-10-22 08:54:50,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230338188] [2019-10-22 08:54:50,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,193 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:54:50,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947766811] [2019-10-22 08:54:50,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-22 08:54:50,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230338188] [2019-10-22 08:54:50,316 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:54:50,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947766811] [2019-10-22 08:54:50,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:50,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:50,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384133999] [2019-10-22 08:54:50,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:50,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:50,318 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-10-22 08:54:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:50,509 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-10-22 08:54:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:50,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-22 08:54:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:50,519 INFO L225 Difference]: With dead ends: 7951 [2019-10-22 08:54:50,520 INFO L226 Difference]: Without dead ends: 2307 [2019-10-22 08:54:50,524 INFO L600 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-10-22 08:54:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-10-22 08:54:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-10-22 08:54:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-10-22 08:54:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-10-22 08:54:50,584 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-10-22 08:54:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:50,584 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-10-22 08:54:50,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-10-22 08:54:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-22 08:54:50,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:50,590 INFO L380 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-10-22 08:54:50,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,791 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-10-22 08:54:50,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142723914] [2019-10-22 08:54:50,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-22 08:54:50,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142723914] [2019-10-22 08:54:50,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:50,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:50,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72922913] [2019-10-22 08:54:50,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:50,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:50,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:50,912 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-10-22 08:54:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,083 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-10-22 08:54:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:51,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-22 08:54:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,087 INFO L225 Difference]: With dead ends: 4829 [2019-10-22 08:54:51,087 INFO L226 Difference]: Without dead ends: 2529 [2019-10-22 08:54:51,089 INFO L600 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-10-22 08:54:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-10-22 08:54:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-10-22 08:54:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-10-22 08:54:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-10-22 08:54:51,141 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-10-22 08:54:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,141 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-10-22 08:54:51,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-10-22 08:54:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-22 08:54:51,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,148 INFO L380 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-10-22 08:54:51,148 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-10-22 08:54:51,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609837067] [2019-10-22 08:54:51,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-10-22 08:54:51,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609837067] [2019-10-22 08:54:51,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:51,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880002801] [2019-10-22 08:54:51,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:51,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,247 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-10-22 08:54:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,394 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-10-22 08:54:51,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:51,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-10-22 08:54:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,398 INFO L225 Difference]: With dead ends: 4949 [2019-10-22 08:54:51,398 INFO L226 Difference]: Without dead ends: 2499 [2019-10-22 08:54:51,400 INFO L600 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-10-22 08:54:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-10-22 08:54:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-10-22 08:54:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-10-22 08:54:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-10-22 08:54:51,450 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-10-22 08:54:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,450 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-10-22 08:54:51,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-10-22 08:54:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-22 08:54:51,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,457 INFO L380 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-10-22 08:54:51,458 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-10-22 08:54:51,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574627659] [2019-10-22 08:54:51,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-22 08:54:51,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574627659] [2019-10-22 08:54:51,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607639617] [2019-10-22 08:54:51,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-22 08:54:51,752 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:51,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:54:51,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492989713] [2019-10-22 08:54:51,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:51,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:51,754 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-10-22 08:54:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,070 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-10-22 08:54:52,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:52,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-10-22 08:54:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,077 INFO L225 Difference]: With dead ends: 7213 [2019-10-22 08:54:52,077 INFO L226 Difference]: Without dead ends: 4617 [2019-10-22 08:54:52,080 INFO L600 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-10-22 08:54:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-10-22 08:54:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-10-22 08:54:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-10-22 08:54:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-10-22 08:54:52,142 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-10-22 08:54:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,142 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-10-22 08:54:52,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-10-22 08:54:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-10-22 08:54:52,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,150 INFO L380 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-10-22 08:54:52,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:52,350 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-10-22 08:54:52,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21293651] [2019-10-22 08:54:52,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-10-22 08:54:52,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21293651] [2019-10-22 08:54:52,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:52,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197971770] [2019-10-22 08:54:52,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:52,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:52,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:52,496 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-10-22 08:54:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,642 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-10-22 08:54:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:52,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-10-22 08:54:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,645 INFO L225 Difference]: With dead ends: 5073 [2019-10-22 08:54:52,646 INFO L226 Difference]: Without dead ends: 2546 [2019-10-22 08:54:52,648 INFO L600 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-10-22 08:54:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-10-22 08:54:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-10-22 08:54:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-10-22 08:54:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-10-22 08:54:52,708 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-10-22 08:54:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,709 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-10-22 08:54:52,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-10-22 08:54:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-10-22 08:54:52,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,715 INFO L380 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-10-22 08:54:52,715 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-10-22 08:54:52,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676632862] [2019-10-22 08:54:52,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-10-22 08:54:52,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676632862] [2019-10-22 08:54:52,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:52,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710896520] [2019-10-22 08:54:52,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:52,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:52,922 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-10-22 08:54:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,064 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-10-22 08:54:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-10-22 08:54:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,068 INFO L225 Difference]: With dead ends: 5277 [2019-10-22 08:54:53,068 INFO L226 Difference]: Without dead ends: 2750 [2019-10-22 08:54:53,070 INFO L600 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-10-22 08:54:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-10-22 08:54:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-10-22 08:54:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-10-22 08:54:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-10-22 08:54:53,122 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-10-22 08:54:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,122 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-10-22 08:54:53,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-10-22 08:54:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-10-22 08:54:53,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,127 INFO L380 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-10-22 08:54:53,127 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-10-22 08:54:53,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425813101] [2019-10-22 08:54:53,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-10-22 08:54:53,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425813101] [2019-10-22 08:54:53,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760030952] [2019-10-22 08:54:53,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:53,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:53,357 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-10-22 08:54:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,520 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-10-22 08:54:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-10-22 08:54:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,525 INFO L225 Difference]: With dead ends: 5697 [2019-10-22 08:54:53,525 INFO L226 Difference]: Without dead ends: 2966 [2019-10-22 08:54:53,527 INFO L600 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-10-22 08:54:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-10-22 08:54:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-10-22 08:54:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-10-22 08:54:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-10-22 08:54:53,584 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-10-22 08:54:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,584 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-10-22 08:54:53,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-10-22 08:54:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-10-22 08:54:53,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,589 INFO L380 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-10-22 08:54:53,589 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-10-22 08:54:53,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930907417] [2019-10-22 08:54:53,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-22 08:54:53,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930907417] [2019-10-22 08:54:53,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006008683] [2019-10-22 08:54:53,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/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-10-22 08:54:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:53,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-22 08:54:54,175 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:54,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:54:54,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987385929] [2019-10-22 08:54:54,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:54,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:54,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:54,177 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-10-22 08:54:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,342 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-10-22 08:54:54,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:54,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-10-22 08:54:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:54,343 INFO L225 Difference]: With dead ends: 4704 [2019-10-22 08:54:54,343 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:54:54,346 INFO L600 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-10-22 08:54:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:54:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:54:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:54:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:54:54,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-10-22 08:54:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:54,347 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:54,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:54,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:54:54,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:54,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:54:54,806 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-10-22 08:54:55,230 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-10-22 08:54:55,453 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-22 08:54:55,573 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-10-22 08:54:55,785 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-22 08:54:55,995 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-10-22 08:54:56,155 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-22 08:54:56,307 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-10-22 08:54:56,456 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-22 08:54:56,640 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-22 08:54:56,830 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-10-22 08:54:57,001 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-22 08:54:57,173 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-10-22 08:54:57,341 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-22 08:54:57,539 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-22 08:54:57,642 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-10-22 08:54:57,786 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-10-22 08:54:57,898 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-22 08:54:58,069 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-10-22 08:54:58,234 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-10-22 08:54:58,234 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-10-22 08:54:58,234 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-10-22 08:54:58,234 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-10-22 08:54:58,234 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-10-22 08:54:58,234 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 593) 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-10-22 08:54:58,235 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 625) 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-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-10-22 08:54:58,235 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 08:54:58,235 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 603) 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-10-22 08:54:58,236 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 614) 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-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-10-22 08:54:58,236 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L439 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-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L446 ceAbstractionStarter]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L446 ceAbstractionStarter]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-10-22 08:54:58,237 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 601) 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-10-22 08:54:58,238 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 612) 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-10-22 08:54:58,238 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-10-22 08:54:58,238 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 624) 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-10-22 08:54:58,238 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-10-22 08:54:58,238 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-10-22 08:54:58,238 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-10-22 08:54:58,238 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-10-22 08:54:58,242 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 599) 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-10-22 08:54:58,243 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 610) 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-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-10-22 08:54:58,243 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 620) 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-10-22 08:54:58,243 INFO L439 ceAbstractionStarter]: At program point L551(lines 64 674) the Hoare annotation is: false [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L446 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 08:54:58,244 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 597) 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-10-22 08:54:58,244 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 608) 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-10-22 08:54:58,244 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 618) 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-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L439 ceAbstractionStarter]: At program point L588(lines 99 656) 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-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-10-22 08:54:58,245 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L446 ceAbstractionStarter]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 595) 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-10-22 08:54:58,246 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 606) 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-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-10-22 08:54:58,246 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L439 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-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-10-22 08:54:58,247 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-10-22 08:54:58,248 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 656) 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-10-22 08:54:58,248 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-10-22 08:54:58,248 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-10-22 08:54:58,248 INFO L443 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-10-22 08:54:58,248 INFO L443 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-10-22 08:54:58,249 INFO L439 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-10-22 08:54:58,249 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 604) 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-10-22 08:54:58,249 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 617) 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-10-22 08:54:58,249 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 08:54:58,249 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-10-22 08:54:58,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:58 BoogieIcfgContainer [2019-10-22 08:54:58,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:58,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:58,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:58,278 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:58,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:42" (3/4) ... [2019-10-22 08:54:58,282 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:54:58,297 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:54:58,298 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:54:58,399 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_63d5f8cc-7b54-4073-9e56-9a947b649a10/bin/uautomizer/witness.graphml [2019-10-22 08:54:58,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:58,401 INFO L168 Benchmark]: Toolchain (without parser) took 17189.59 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 880.8 MB). Free memory was 948.5 MB in the beginning and 1.4 GB in the end (delta: -483.4 MB). Peak memory consumption was 397.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,401 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:58,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.91 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-10-22 08:54:58,402 INFO L168 Benchmark]: Boogie Preprocessor took 31.07 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,402 INFO L168 Benchmark]: RCFGBuilder took 658.94 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,402 INFO L168 Benchmark]: TraceAbstraction took 15932.04 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -391.4 MB). Peak memory consumption was 756.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,403 INFO L168 Benchmark]: Witness Printer took 121.89 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,404 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.91 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. * Boogie Preprocessor took 31.07 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.94 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15932.04 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -391.4 MB). Peak memory consumption was 756.2 MB. Max. memory is 11.5 GB. * Witness Printer took 121.89 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((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: 676]: Loop Invariant Derived loop invariant: 1 - 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: 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: 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: 64]: 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: 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: 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: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - 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: 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: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - 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: 15.8s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1911 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40537 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6399 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3926 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...