./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:47:24,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:24,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:24,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:24,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:24,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:24,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:24,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:24,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:24,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:24,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:24,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:24,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:24,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:24,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:24,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:24,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:24,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:24,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:24,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:24,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:24,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:24,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:24,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:24,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:24,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:24,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:24,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:24,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:24,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:24,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:24,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:24,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:24,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:24,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:24,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:24,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:24,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:24,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:24,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:24,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:24,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:47:24,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:24,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:24,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:24,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:24,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:24,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:24,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:24,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:24,780 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:24,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:24,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:24,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:24,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:24,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:24,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:47:24,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:24,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:47:24,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:24,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:47:24,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:24,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:47:24,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:24,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:24,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:24,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:24,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:24,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:24,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:47:24,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:24,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:24,787 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:47:24,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:47:24,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:47:24,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc 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(reach_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 -> ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 [2022-11-02 20:47:25,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:25,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:25,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:25,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:25,113 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:25,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2022-11-02 20:47:25,178 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/data/e9fec31be/9ffc1a3e35a14f8db1197443907c1234/FLAGef1103b80 [2022-11-02 20:47:25,729 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:25,730 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2022-11-02 20:47:25,754 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/data/e9fec31be/9ffc1a3e35a14f8db1197443907c1234/FLAGef1103b80 [2022-11-02 20:47:26,034 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/data/e9fec31be/9ffc1a3e35a14f8db1197443907c1234 [2022-11-02 20:47:26,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:26,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:26,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:26,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:26,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:26,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f70eebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26, skipping insertion in model container [2022-11-02 20:47:26,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:26,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:26,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2022-11-02 20:47:26,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:26,468 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:26,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2022-11-02 20:47:26,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:26,589 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:26,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26 WrapperNode [2022-11-02 20:47:26,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:26,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:26,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:26,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:26,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,667 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 529 [2022-11-02 20:47:26,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:26,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:26,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:26,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:26,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,735 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:26,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:26,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:26,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:26,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (1/1) ... [2022-11-02 20:47:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:26,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:26,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:26,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:47:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:26,970 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:26,972 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:26,998 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:47:27,677 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 20:47:27,677 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 20:47:27,678 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:47:27,685 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:47:27,687 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:47:27,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:27 BoogieIcfgContainer [2022-11-02 20:47:27,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:47:27,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:47:27,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:47:27,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:47:27,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:26" (1/3) ... [2022-11-02 20:47:27,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b6d2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:27, skipping insertion in model container [2022-11-02 20:47:27,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:26" (2/3) ... [2022-11-02 20:47:27,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b6d2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:27, skipping insertion in model container [2022-11-02 20:47:27,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:27" (3/3) ... [2022-11-02 20:47:27,714 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2022-11-02 20:47:27,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:47:27,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:47:27,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:27,837 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c7ed52e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:27,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:47:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:47:27,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:27,865 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:47:27,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2022-11-02 20:47:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:27,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708387816] [2022-11-02 20:47:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:28,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708387816] [2022-11-02 20:47:28,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708387816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:28,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:28,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037498427] [2022-11-02 20:47:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:28,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:28,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:28,434 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:28,785 INFO L93 Difference]: Finished difference Result 317 states and 547 transitions. [2022-11-02 20:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:47:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:28,804 INFO L225 Difference]: With dead ends: 317 [2022-11-02 20:47:28,804 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 20:47:28,808 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:28,812 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:28,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 177 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 20:47:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2022-11-02 20:47:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.6) internal successors, (248), 155 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2022-11-02 20:47:28,891 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 44 [2022-11-02 20:47:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:28,892 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2022-11-02 20:47:28,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2022-11-02 20:47:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:47:28,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:28,901 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-02 20:47:28,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:47:28,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash -954580408, now seen corresponding path program 1 times [2022-11-02 20:47:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:28,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594633564] [2022-11-02 20:47:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:29,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594633564] [2022-11-02 20:47:29,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594633564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:29,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:29,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507109667] [2022-11-02 20:47:29,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:29,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:29,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:29,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:29,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:29,031 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:29,242 INFO L93 Difference]: Finished difference Result 352 states and 565 transitions. [2022-11-02 20:47:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:29,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-02 20:47:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:29,249 INFO L225 Difference]: With dead ends: 352 [2022-11-02 20:47:29,249 INFO L226 Difference]: Without dead ends: 202 [2022-11-02 20:47:29,257 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:29,259 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 110 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:29,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 126 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-02 20:47:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2022-11-02 20:47:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.6326530612244898) internal successors, (320), 196 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2022-11-02 20:47:29,280 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 45 [2022-11-02 20:47:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:29,281 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2022-11-02 20:47:29,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2022-11-02 20:47:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:47:29,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:29,291 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:47:29,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:47:29,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2022-11-02 20:47:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545753165] [2022-11-02 20:47:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:29,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:29,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545753165] [2022-11-02 20:47:29,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545753165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:29,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:29,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:29,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167562206] [2022-11-02 20:47:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:29,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:29,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:29,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:29,468 INFO L87 Difference]: Start difference. First operand 197 states and 320 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:29,523 INFO L93 Difference]: Finished difference Result 569 states and 929 transitions. [2022-11-02 20:47:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-02 20:47:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:29,526 INFO L225 Difference]: With dead ends: 569 [2022-11-02 20:47:29,527 INFO L226 Difference]: Without dead ends: 380 [2022-11-02 20:47:29,530 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:29,535 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:29,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 475 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-02 20:47:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-02 20:47:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.6279683377308707) internal successors, (617), 379 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 617 transitions. [2022-11-02 20:47:29,590 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 617 transitions. Word has length 60 [2022-11-02 20:47:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:29,592 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 617 transitions. [2022-11-02 20:47:29,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 617 transitions. [2022-11-02 20:47:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:47:29,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:29,594 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:47:29,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:47:29,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2013663709, now seen corresponding path program 1 times [2022-11-02 20:47:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110366118] [2022-11-02 20:47:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:29,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110366118] [2022-11-02 20:47:29,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110366118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:29,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:29,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446794054] [2022-11-02 20:47:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:29,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:29,685 INFO L87 Difference]: Start difference. First operand 380 states and 617 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:29,723 INFO L93 Difference]: Finished difference Result 938 states and 1528 transitions. [2022-11-02 20:47:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:29,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-11-02 20:47:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:29,728 INFO L225 Difference]: With dead ends: 938 [2022-11-02 20:47:29,728 INFO L226 Difference]: Without dead ends: 566 [2022-11-02 20:47:29,729 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:29,736 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:29,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-11-02 20:47:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2022-11-02 20:47:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.6247787610619469) internal successors, (918), 565 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 918 transitions. [2022-11-02 20:47:29,767 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 918 transitions. Word has length 60 [2022-11-02 20:47:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:29,767 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 918 transitions. [2022-11-02 20:47:29,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 918 transitions. [2022-11-02 20:47:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:47:29,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:29,769 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:29,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:47:29,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:29,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1930486570, now seen corresponding path program 1 times [2022-11-02 20:47:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:29,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116612131] [2022-11-02 20:47:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:29,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:47:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:29,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116612131] [2022-11-02 20:47:29,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116612131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:29,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:29,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871702968] [2022-11-02 20:47:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:29,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:29,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:29,849 INFO L87 Difference]: Start difference. First operand 566 states and 918 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:30,048 INFO L93 Difference]: Finished difference Result 1336 states and 2193 transitions. [2022-11-02 20:47:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:30,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-02 20:47:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:30,052 INFO L225 Difference]: With dead ends: 1336 [2022-11-02 20:47:30,052 INFO L226 Difference]: Without dead ends: 778 [2022-11-02 20:47:30,053 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:30,054 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:30,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-02 20:47:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 766. [2022-11-02 20:47:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.461437908496732) internal successors, (1118), 765 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1118 transitions. [2022-11-02 20:47:30,083 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1118 transitions. Word has length 97 [2022-11-02 20:47:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:30,084 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1118 transitions. [2022-11-02 20:47:30,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1118 transitions. [2022-11-02 20:47:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:47:30,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:30,087 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:30,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:47:30,087 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1496757484, now seen corresponding path program 1 times [2022-11-02 20:47:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:30,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021856040] [2022-11-02 20:47:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:47:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:30,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021856040] [2022-11-02 20:47:30,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021856040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:30,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:30,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58866597] [2022-11-02 20:47:30,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:30,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:30,164 INFO L87 Difference]: Start difference. First operand 766 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:30,365 INFO L93 Difference]: Finished difference Result 1653 states and 2450 transitions. [2022-11-02 20:47:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:30,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-02 20:47:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:30,370 INFO L225 Difference]: With dead ends: 1653 [2022-11-02 20:47:30,370 INFO L226 Difference]: Without dead ends: 895 [2022-11-02 20:47:30,371 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:30,372 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 81 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:30,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 224 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-02 20:47:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 859. [2022-11-02 20:47:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.456876456876457) internal successors, (1250), 858 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1250 transitions. [2022-11-02 20:47:30,405 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1250 transitions. Word has length 97 [2022-11-02 20:47:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:30,405 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1250 transitions. [2022-11-02 20:47:30,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1250 transitions. [2022-11-02 20:47:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-02 20:47:30,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:30,408 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:30,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:47:30,409 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1340556462, now seen corresponding path program 1 times [2022-11-02 20:47:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:30,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667960948] [2022-11-02 20:47:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:47:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:30,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667960948] [2022-11-02 20:47:30,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667960948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:30,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:30,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548256928] [2022-11-02 20:47:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:30,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:30,503 INFO L87 Difference]: Start difference. First operand 859 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:30,552 INFO L93 Difference]: Finished difference Result 1746 states and 2558 transitions. [2022-11-02 20:47:30,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:30,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-11-02 20:47:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:30,557 INFO L225 Difference]: With dead ends: 1746 [2022-11-02 20:47:30,557 INFO L226 Difference]: Without dead ends: 1153 [2022-11-02 20:47:30,559 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:30,559 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:30,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 484 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-11-02 20:47:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2022-11-02 20:47:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4592013888888888) internal successors, (1681), 1152 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1681 transitions. [2022-11-02 20:47:30,598 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1681 transitions. Word has length 121 [2022-11-02 20:47:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:30,598 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1681 transitions. [2022-11-02 20:47:30,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1681 transitions. [2022-11-02 20:47:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-02 20:47:30,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:30,602 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:30,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:47:30,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2057017556, now seen corresponding path program 1 times [2022-11-02 20:47:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:30,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034617068] [2022-11-02 20:47:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:47:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:30,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034617068] [2022-11-02 20:47:30,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034617068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:30,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:30,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816039579] [2022-11-02 20:47:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:30,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:30,663 INFO L87 Difference]: Start difference. First operand 1153 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:30,717 INFO L93 Difference]: Finished difference Result 2297 states and 3379 transitions. [2022-11-02 20:47:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-11-02 20:47:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:30,723 INFO L225 Difference]: With dead ends: 2297 [2022-11-02 20:47:30,723 INFO L226 Difference]: Without dead ends: 1410 [2022-11-02 20:47:30,724 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:30,725 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:30,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 485 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-11-02 20:47:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2022-11-02 20:47:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 1.4698367636621719) internal successors, (2071), 1409 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2071 transitions. [2022-11-02 20:47:30,796 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2071 transitions. Word has length 121 [2022-11-02 20:47:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:30,796 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 2071 transitions. [2022-11-02 20:47:30,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2071 transitions. [2022-11-02 20:47:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-02 20:47:30,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:30,801 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:30,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:47:30,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -860101462, now seen corresponding path program 1 times [2022-11-02 20:47:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:30,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180866029] [2022-11-02 20:47:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:30,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:47:30,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:30,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180866029] [2022-11-02 20:47:30,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180866029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:30,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:30,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513130825] [2022-11-02 20:47:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:30,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:30,917 INFO L87 Difference]: Start difference. First operand 1410 states and 2071 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:31,089 INFO L93 Difference]: Finished difference Result 3017 states and 4490 transitions. [2022-11-02 20:47:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:31,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2022-11-02 20:47:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:31,095 INFO L225 Difference]: With dead ends: 3017 [2022-11-02 20:47:31,096 INFO L226 Difference]: Without dead ends: 1565 [2022-11-02 20:47:31,100 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:31,102 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:31,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 255 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:31,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-11-02 20:47:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-11-02 20:47:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1564 states have (on average 1.4392583120204603) internal successors, (2251), 1564 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2251 transitions. [2022-11-02 20:47:31,177 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2251 transitions. Word has length 225 [2022-11-02 20:47:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:31,178 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 2251 transitions. [2022-11-02 20:47:31,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2251 transitions. [2022-11-02 20:47:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:47:31,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:31,185 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:31,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:47:31,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -482554043, now seen corresponding path program 1 times [2022-11-02 20:47:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:31,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476739549] [2022-11-02 20:47:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:47:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:31,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476739549] [2022-11-02 20:47:31,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476739549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:31,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840445760] [2022-11-02 20:47:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:31,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:31,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:31,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:47:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:31,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:47:31,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:47:31,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:47:31,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840445760] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:31,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:31,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:47:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307142310] [2022-11-02 20:47:31,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:31,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:31,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:31,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:31,837 INFO L87 Difference]: Start difference. First operand 1565 states and 2251 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:32,753 INFO L93 Difference]: Finished difference Result 6075 states and 8721 transitions. [2022-11-02 20:47:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:47:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-11-02 20:47:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:32,769 INFO L225 Difference]: With dead ends: 6075 [2022-11-02 20:47:32,769 INFO L226 Difference]: Without dead ends: 4518 [2022-11-02 20:47:32,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:32,773 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 336 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:32,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1227 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:47:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2022-11-02 20:47:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3398. [2022-11-02 20:47:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3397 states have (on average 1.40270827200471) internal successors, (4765), 3397 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4765 transitions. [2022-11-02 20:47:32,934 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4765 transitions. Word has length 253 [2022-11-02 20:47:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:32,934 INFO L495 AbstractCegarLoop]: Abstraction has 3398 states and 4765 transitions. [2022-11-02 20:47:32,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4765 transitions. [2022-11-02 20:47:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:47:32,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:32,944 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:32,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:47:33,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:47:33,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash -193734653, now seen corresponding path program 1 times [2022-11-02 20:47:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:33,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704935653] [2022-11-02 20:47:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-11-02 20:47:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704935653] [2022-11-02 20:47:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704935653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410441350] [2022-11-02 20:47:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:33,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:33,277 INFO L87 Difference]: Start difference. First operand 3398 states and 4765 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:33,479 INFO L93 Difference]: Finished difference Result 9681 states and 13694 transitions. [2022-11-02 20:47:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:33,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-11-02 20:47:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:33,494 INFO L225 Difference]: With dead ends: 9681 [2022-11-02 20:47:33,494 INFO L226 Difference]: Without dead ends: 4220 [2022-11-02 20:47:33,498 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:33,499 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:33,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:33,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2022-11-02 20:47:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3918. [2022-11-02 20:47:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3917 states have (on average 1.4237937196834312) internal successors, (5577), 3917 states have internal predecessors, (5577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5577 transitions. [2022-11-02 20:47:33,642 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5577 transitions. Word has length 253 [2022-11-02 20:47:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:33,642 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 5577 transitions. [2022-11-02 20:47:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5577 transitions. [2022-11-02 20:47:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:47:33,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:33,651 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:33,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:47:33,651 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1163625151, now seen corresponding path program 1 times [2022-11-02 20:47:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848852952] [2022-11-02 20:47:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-02 20:47:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:33,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848852952] [2022-11-02 20:47:33,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848852952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:33,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:33,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:33,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95442833] [2022-11-02 20:47:33,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:33,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:33,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:33,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:33,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:33,746 INFO L87 Difference]: Start difference. First operand 3918 states and 5577 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:34,031 INFO L93 Difference]: Finished difference Result 8008 states and 11372 transitions. [2022-11-02 20:47:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:34,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-11-02 20:47:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:34,046 INFO L225 Difference]: With dead ends: 8008 [2022-11-02 20:47:34,047 INFO L226 Difference]: Without dead ends: 4098 [2022-11-02 20:47:34,051 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:34,052 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:34,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 272 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2022-11-02 20:47:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4056. [2022-11-02 20:47:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4055 states have (on average 1.4167694204685573) internal successors, (5745), 4055 states have internal predecessors, (5745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5745 transitions. [2022-11-02 20:47:34,221 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5745 transitions. Word has length 253 [2022-11-02 20:47:34,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:34,221 INFO L495 AbstractCegarLoop]: Abstraction has 4056 states and 5745 transitions. [2022-11-02 20:47:34,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5745 transitions. [2022-11-02 20:47:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-02 20:47:34,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:34,232 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:34,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:47:34,233 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1335839441, now seen corresponding path program 1 times [2022-11-02 20:47:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:34,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912005635] [2022-11-02 20:47:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-11-02 20:47:34,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:34,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912005635] [2022-11-02 20:47:34,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912005635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:34,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:34,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130744706] [2022-11-02 20:47:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:34,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:34,359 INFO L87 Difference]: Start difference. First operand 4056 states and 5745 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:34,583 INFO L93 Difference]: Finished difference Result 8622 states and 12220 transitions. [2022-11-02 20:47:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2022-11-02 20:47:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:34,600 INFO L225 Difference]: With dead ends: 8622 [2022-11-02 20:47:34,600 INFO L226 Difference]: Without dead ends: 4574 [2022-11-02 20:47:34,605 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:34,606 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:34,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2022-11-02 20:47:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4406. [2022-11-02 20:47:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4406 states, 4405 states have (on average 1.3995459704880817) internal successors, (6165), 4405 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 6165 transitions. [2022-11-02 20:47:34,818 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 6165 transitions. Word has length 273 [2022-11-02 20:47:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:34,819 INFO L495 AbstractCegarLoop]: Abstraction has 4406 states and 6165 transitions. [2022-11-02 20:47:34,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 6165 transitions. [2022-11-02 20:47:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-11-02 20:47:34,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:34,829 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:34,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:47:34,829 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -257796221, now seen corresponding path program 1 times [2022-11-02 20:47:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:34,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365986594] [2022-11-02 20:47:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2022-11-02 20:47:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:34,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365986594] [2022-11-02 20:47:34,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365986594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:34,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:34,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:34,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602509352] [2022-11-02 20:47:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:34,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:34,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:34,953 INFO L87 Difference]: Start difference. First operand 4406 states and 6165 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:35,183 INFO L93 Difference]: Finished difference Result 9266 states and 12990 transitions. [2022-11-02 20:47:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:35,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2022-11-02 20:47:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:35,210 INFO L225 Difference]: With dead ends: 9266 [2022-11-02 20:47:35,216 INFO L226 Difference]: Without dead ends: 4868 [2022-11-02 20:47:35,222 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:35,223 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:35,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 272 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2022-11-02 20:47:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4784. [2022-11-02 20:47:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4783 states have (on average 1.382605059586034) internal successors, (6613), 4783 states have internal predecessors, (6613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6613 transitions. [2022-11-02 20:47:35,438 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6613 transitions. Word has length 299 [2022-11-02 20:47:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:35,438 INFO L495 AbstractCegarLoop]: Abstraction has 4784 states and 6613 transitions. [2022-11-02 20:47:35,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6613 transitions. [2022-11-02 20:47:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-11-02 20:47:35,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:35,449 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:35,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:47:35,449 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash 212293102, now seen corresponding path program 1 times [2022-11-02 20:47:35,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:35,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680244840] [2022-11-02 20:47:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2022-11-02 20:47:35,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:35,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680244840] [2022-11-02 20:47:35,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680244840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:35,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:35,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:35,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898708462] [2022-11-02 20:47:35,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:35,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:35,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:35,598 INFO L87 Difference]: Start difference. First operand 4784 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:35,897 INFO L93 Difference]: Finished difference Result 9980 states and 13802 transitions. [2022-11-02 20:47:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:35,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2022-11-02 20:47:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:35,914 INFO L225 Difference]: With dead ends: 9980 [2022-11-02 20:47:35,914 INFO L226 Difference]: Without dead ends: 5204 [2022-11-02 20:47:35,923 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:35,924 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:35,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2022-11-02 20:47:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4391. [2022-11-02 20:47:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4391 states, 4390 states have (on average 1.3824601366742597) internal successors, (6069), 4390 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 6069 transitions. [2022-11-02 20:47:36,147 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 6069 transitions. Word has length 322 [2022-11-02 20:47:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:36,147 INFO L495 AbstractCegarLoop]: Abstraction has 4391 states and 6069 transitions. [2022-11-02 20:47:36,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 6069 transitions. [2022-11-02 20:47:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-11-02 20:47:36,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:36,160 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:36,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:47:36,161 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash -812160295, now seen corresponding path program 1 times [2022-11-02 20:47:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:36,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879068080] [2022-11-02 20:47:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2022-11-02 20:47:36,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:36,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879068080] [2022-11-02 20:47:36,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879068080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:36,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:36,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:36,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989578765] [2022-11-02 20:47:36,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:36,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:36,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:36,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:36,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:36,318 INFO L87 Difference]: Start difference. First operand 4391 states and 6069 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:36,615 INFO L93 Difference]: Finished difference Result 13143 states and 18162 transitions. [2022-11-02 20:47:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2022-11-02 20:47:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:36,634 INFO L225 Difference]: With dead ends: 13143 [2022-11-02 20:47:36,634 INFO L226 Difference]: Without dead ends: 8760 [2022-11-02 20:47:36,640 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:47:36,641 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:36,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 486 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8760 states. [2022-11-02 20:47:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8760 to 8575. [2022-11-02 20:47:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8574 states have (on average 1.385117797993935) internal successors, (11876), 8574 states have internal predecessors, (11876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 11876 transitions. [2022-11-02 20:47:37,029 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 11876 transitions. Word has length 354 [2022-11-02 20:47:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:37,030 INFO L495 AbstractCegarLoop]: Abstraction has 8575 states and 11876 transitions. [2022-11-02 20:47:37,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 11876 transitions. [2022-11-02 20:47:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-11-02 20:47:37,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:37,045 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:37,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:47:37,046 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:37,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash 209922624, now seen corresponding path program 1 times [2022-11-02 20:47:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:37,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198415669] [2022-11-02 20:47:37,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-11-02 20:47:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:37,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198415669] [2022-11-02 20:47:37,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198415669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:37,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724840198] [2022-11-02 20:47:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:37,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:37,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:37,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:47:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:37,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:47:37,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-11-02 20:47:37,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:37,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724840198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:37,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:47:37,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:47:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947613770] [2022-11-02 20:47:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:37,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:37,792 INFO L87 Difference]: Start difference. First operand 8575 states and 11876 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:38,079 INFO L93 Difference]: Finished difference Result 10751 states and 14913 transitions. [2022-11-02 20:47:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2022-11-02 20:47:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:38,097 INFO L225 Difference]: With dead ends: 10751 [2022-11-02 20:47:38,097 INFO L226 Difference]: Without dead ends: 8530 [2022-11-02 20:47:38,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:38,102 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 83 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:38,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8530 states. [2022-11-02 20:47:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8530 to 6140. [2022-11-02 20:47:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 1.3924091871640332) internal successors, (8548), 6139 states have internal predecessors, (8548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 8548 transitions. [2022-11-02 20:47:38,371 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 8548 transitions. Word has length 355 [2022-11-02 20:47:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:38,372 INFO L495 AbstractCegarLoop]: Abstraction has 6140 states and 8548 transitions. [2022-11-02 20:47:38,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 8548 transitions. [2022-11-02 20:47:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2022-11-02 20:47:38,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:38,392 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 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, 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] [2022-11-02 20:47:38,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:38,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:47:38,605 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:38,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1965226690, now seen corresponding path program 1 times [2022-11-02 20:47:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:38,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158230760] [2022-11-02 20:47:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-11-02 20:47:38,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:38,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158230760] [2022-11-02 20:47:38,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158230760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:38,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345616865] [2022-11-02 20:47:38,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:38,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:38,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:38,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:47:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:39,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:47:39,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-11-02 20:47:39,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-11-02 20:47:39,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345616865] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:39,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:39,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:47:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808473666] [2022-11-02 20:47:39,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:39,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:39,365 INFO L87 Difference]: Start difference. First operand 6140 states and 8548 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:40,094 INFO L93 Difference]: Finished difference Result 13848 states and 19249 transitions. [2022-11-02 20:47:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:47:40,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 417 [2022-11-02 20:47:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:40,110 INFO L225 Difference]: With dead ends: 13848 [2022-11-02 20:47:40,111 INFO L226 Difference]: Without dead ends: 7414 [2022-11-02 20:47:40,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:40,119 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 383 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:40,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 499 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7414 states. [2022-11-02 20:47:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7414 to 6032. [2022-11-02 20:47:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6032 states, 6031 states have (on average 1.3669374896368762) internal successors, (8244), 6031 states have internal predecessors, (8244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 8244 transitions. [2022-11-02 20:47:40,416 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 8244 transitions. Word has length 417 [2022-11-02 20:47:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:40,417 INFO L495 AbstractCegarLoop]: Abstraction has 6032 states and 8244 transitions. [2022-11-02 20:47:40,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 8244 transitions. [2022-11-02 20:47:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-11-02 20:47:40,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:40,435 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2022-11-02 20:47:40,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:40,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:40,649 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1529804208, now seen corresponding path program 1 times [2022-11-02 20:47:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:40,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429003138] [2022-11-02 20:47:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1660 proven. 77 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2022-11-02 20:47:41,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:41,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429003138] [2022-11-02 20:47:41,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429003138] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:41,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820949127] [2022-11-02 20:47:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:41,099 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:41,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:47:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:41,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:47:41,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-11-02 20:47:41,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:41,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820949127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:41,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:47:41,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:47:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522584322] [2022-11-02 20:47:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:41,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:41,374 INFO L87 Difference]: Start difference. First operand 6032 states and 8244 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:41,706 INFO L93 Difference]: Finished difference Result 12486 states and 17159 transitions. [2022-11-02 20:47:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 509 [2022-11-02 20:47:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:41,725 INFO L225 Difference]: With dead ends: 12486 [2022-11-02 20:47:41,725 INFO L226 Difference]: Without dead ends: 6462 [2022-11-02 20:47:41,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:41,733 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 92 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:41,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 216 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2022-11-02 20:47:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 6266. [2022-11-02 20:47:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 6265 states have (on average 1.3661612130885874) internal successors, (8559), 6265 states have internal predecessors, (8559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 8559 transitions. [2022-11-02 20:47:41,985 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 8559 transitions. Word has length 509 [2022-11-02 20:47:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:41,986 INFO L495 AbstractCegarLoop]: Abstraction has 6266 states and 8559 transitions. [2022-11-02 20:47:41,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 8559 transitions. [2022-11-02 20:47:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2022-11-02 20:47:42,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:42,009 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2022-11-02 20:47:42,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:42,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:42,227 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:42,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1911316890, now seen corresponding path program 1 times [2022-11-02 20:47:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:42,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979613979] [2022-11-02 20:47:42,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2022-11-02 20:47:42,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:42,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979613979] [2022-11-02 20:47:42,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979613979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:42,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501064496] [2022-11-02 20:47:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:42,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:42,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:42,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:42,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:47:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:42,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:42,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 239 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-11-02 20:47:44,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1887 proven. 144 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-11-02 20:47:46,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501064496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:46,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:46,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-02 20:47:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211411484] [2022-11-02 20:47:46,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:46,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:46,093 INFO L87 Difference]: Start difference. First operand 6266 states and 8559 transitions. Second operand has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:49,700 INFO L93 Difference]: Finished difference Result 25619 states and 35084 transitions. [2022-11-02 20:47:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:47:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 513 [2022-11-02 20:47:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:49,734 INFO L225 Difference]: With dead ends: 25619 [2022-11-02 20:47:49,735 INFO L226 Difference]: Without dead ends: 20476 [2022-11-02 20:47:49,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1033 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:47:49,745 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 1243 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:49,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1558 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1671 Invalid, 0 Unknown, 716 Unchecked, 1.9s Time] [2022-11-02 20:47:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20476 states. [2022-11-02 20:47:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20476 to 19067. [2022-11-02 20:47:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19067 states, 19066 states have (on average 1.3313227735235498) internal successors, (25383), 19066 states have internal predecessors, (25383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19067 states to 19067 states and 25383 transitions. [2022-11-02 20:47:50,876 INFO L78 Accepts]: Start accepts. Automaton has 19067 states and 25383 transitions. Word has length 513 [2022-11-02 20:47:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:50,876 INFO L495 AbstractCegarLoop]: Abstraction has 19067 states and 25383 transitions. [2022-11-02 20:47:50,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19067 states and 25383 transitions. [2022-11-02 20:47:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2022-11-02 20:47:50,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:50,925 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-11-02 20:47:50,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:51,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:51,149 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash 944376353, now seen corresponding path program 2 times [2022-11-02 20:47:51,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:51,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193884200] [2022-11-02 20:47:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:51,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2022-11-02 20:47:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193884200] [2022-11-02 20:47:51,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193884200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796571642] [2022-11-02 20:47:51,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:47:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:51,413 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:51,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:47:51,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:47:51,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:47:51,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:47:51,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2022-11-02 20:47:51,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2022-11-02 20:47:51,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796571642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:51,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:51,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-02 20:47:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118330486] [2022-11-02 20:47:51,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:51,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:51,819 INFO L87 Difference]: Start difference. First operand 19067 states and 25383 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:53,136 INFO L93 Difference]: Finished difference Result 29586 states and 39053 transitions. [2022-11-02 20:47:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:47:53,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 583 [2022-11-02 20:47:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:53,138 INFO L225 Difference]: With dead ends: 29586 [2022-11-02 20:47:53,138 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:47:53,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:47:53,161 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 262 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:53,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 728 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:47:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:47:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:47:53,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2022-11-02 20:47:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:53,164 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:47:53,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:47:53,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:47:53,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:47:53,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:53,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:53,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:48:05,236 WARN L234 SmtUtils]: Spent 7.73s on a formula simplification. DAG size of input: 749 DAG size of output: 723 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:12,153 WARN L234 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 750 DAG size of output: 724 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:29,637 WARN L234 SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 723 DAG size of output: 121 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 20:48:38,893 WARN L234 SmtUtils]: Spent 8.86s on a formula simplification. DAG size of input: 724 DAG size of output: 121 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 20:48:39,894 INFO L902 garLoopResultBuilder]: At program point L696(lines 687 698) the Hoare annotation is: true [2022-11-02 20:48:39,895 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 397) no Hoare annotation was computed. [2022-11-02 20:48:39,895 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-11-02 20:48:39,895 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-11-02 20:48:39,895 INFO L899 garLoopResultBuilder]: For program point L333-2(lines 333 337) no Hoare annotation was computed. [2022-11-02 20:48:39,895 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 607) no Hoare annotation was computed. [2022-11-02 20:48:39,895 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 618) no Hoare annotation was computed. [2022-11-02 20:48:39,896 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 629) no Hoare annotation was computed. [2022-11-02 20:48:39,896 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 537) no Hoare annotation was computed. [2022-11-02 20:48:39,896 INFO L895 garLoopResultBuilder]: At program point L202(lines 198 608) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse4 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse1 .cse7) (and .cse4 .cse0 .cse6 .cse1 .cse7) (and .cse4 .cse6 .cse1 .cse8 .cse7) (and .cse1 .cse8 .cse3) (and .cse4 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse6 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1 .cse7) (and .cse5 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3))) [2022-11-02 20:48:39,897 INFO L895 garLoopResultBuilder]: At program point L169(lines 165 619) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-11-02 20:48:39,897 INFO L895 garLoopResultBuilder]: At program point L136(lines 135 629) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse1 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse3) (and .cse1 .cse2 .cse8) (and .cse5 .cse4 .cse6 .cse7) (and .cse5 .cse6 .cse8 .cse7))) [2022-11-02 20:48:39,897 INFO L895 garLoopResultBuilder]: At program point L599(lines 111 667) the Hoare annotation is: (let ((.cse24 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse23 (* (div .cse24 4294967296) 4294967296)) (.cse16 (mod .cse24 4294967296))) (let ((.cse17 (not (<= .cse16 2147483647))) (.cse21 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse25 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse23) .cse24))) (let ((.cse5 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse3 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse18 (or (and (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse23 4294967296) .cse24) (not (<= .cse24 (+ 2147483647 .cse23)))) .cse25)) (.cse9 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse10 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse12 (not .cse21)) (.cse11 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse19 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse22 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse26 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (or (< .cse16 8656) .cse17)) (.cse27 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse14 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse2) (and .cse4 .cse2 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse5 .cse6 .cse2) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse12) (and .cse0 .cse13 .cse7 .cse8 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse4 .cse2) (and .cse14 .cse9 .cse8 .cse2 .cse15) (and .cse0 (or (<= .cse16 8496) .cse17)) (and .cse18 .cse4 .cse19 .cse1) (and .cse9 .cse13 .cse20 .cse21 .cse2) (and .cse14 .cse0 .cse22 .cse2) (and .cse4 .cse1 .cse2 .cse3) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse2) (and .cse0 .cse13 .cse20) (and .cse0 .cse13 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) .cse2) (and .cse18 .cse4 .cse19 .cse7 .cse8) (and .cse14 .cse9 .cse12 .cse15) (and .cse9 .cse10 .cse13 .cse12) (and .cse4 (= (+ 8496 .cse23) .cse24) .cse25 .cse8) (and .cse4 .cse19 .cse22 .cse1 .cse2) (and .cse4 .cse13 .cse7 .cse8 .cse2) (and .cse0 .cse12) (and .cse4 .cse26 .cse7 .cse8 .cse2 .cse27) (and .cse14 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse11 .cse8 .cse2) (and .cse4 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (and .cse0 .cse25) (and .cse4 .cse19 .cse22 .cse7 .cse8 .cse2) (and .cse0 .cse26 .cse7 .cse8 .cse2 .cse27) (and .cse14 .cse0 .cse15)))))) [2022-11-02 20:48:39,898 INFO L899 garLoopResultBuilder]: For program point L566(lines 566 570) no Hoare annotation was computed. [2022-11-02 20:48:39,898 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2022-11-02 20:48:39,898 INFO L899 garLoopResultBuilder]: For program point L302-2(lines 221 598) no Hoare annotation was computed. [2022-11-02 20:48:39,898 INFO L899 garLoopResultBuilder]: For program point L369(lines 369 396) no Hoare annotation was computed. [2022-11-02 20:48:39,898 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 369 396) no Hoare annotation was computed. [2022-11-02 20:48:39,898 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 606) no Hoare annotation was computed. [2022-11-02 20:48:39,898 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 617) no Hoare annotation was computed. [2022-11-02 20:48:39,899 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 628) no Hoare annotation was computed. [2022-11-02 20:48:39,899 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 393) no Hoare annotation was computed. [2022-11-02 20:48:39,899 INFO L902 garLoopResultBuilder]: At program point L668(lines 110 669) the Hoare annotation is: true [2022-11-02 20:48:39,899 INFO L899 garLoopResultBuilder]: For program point L405(lines 405 436) no Hoare annotation was computed. [2022-11-02 20:48:39,899 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 605) no Hoare annotation was computed. [2022-11-02 20:48:39,899 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 616) no Hoare annotation was computed. [2022-11-02 20:48:39,900 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 627) no Hoare annotation was computed. [2022-11-02 20:48:39,900 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 665) no Hoare annotation was computed. [2022-11-02 20:48:39,900 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-11-02 20:48:39,900 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 392) no Hoare annotation was computed. [2022-11-02 20:48:39,900 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 258) no Hoare annotation was computed. [2022-11-02 20:48:39,900 INFO L895 garLoopResultBuilder]: At program point L208(lines 204 606) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse6 (let ((.cse8 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse8 8656) (not (<= .cse8 2147483647))))) (.cse7 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse4))) [2022-11-02 20:48:39,901 INFO L895 garLoopResultBuilder]: At program point L175(lines 171 617) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse6 .cse4))) [2022-11-02 20:48:39,901 INFO L899 garLoopResultBuilder]: For program point L241-2(lines 221 598) no Hoare annotation was computed. [2022-11-02 20:48:39,901 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 662) no Hoare annotation was computed. [2022-11-02 20:48:39,901 INFO L899 garLoopResultBuilder]: For program point L572(lines 572 576) no Hoare annotation was computed. [2022-11-02 20:48:39,901 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 543) no Hoare annotation was computed. [2022-11-02 20:48:39,901 INFO L899 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2022-11-02 20:48:39,902 INFO L899 garLoopResultBuilder]: For program point L572-2(lines 572 576) no Hoare annotation was computed. [2022-11-02 20:48:39,902 INFO L899 garLoopResultBuilder]: For program point L539-2(lines 221 598) no Hoare annotation was computed. [2022-11-02 20:48:39,902 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 378) no Hoare annotation was computed. [2022-11-02 20:48:39,902 INFO L899 garLoopResultBuilder]: For program point L374-2(lines 373 390) no Hoare annotation was computed. [2022-11-02 20:48:39,902 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 676) no Hoare annotation was computed. [2022-11-02 20:48:39,902 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 648) no Hoare annotation was computed. [2022-11-02 20:48:39,902 INFO L899 garLoopResultBuilder]: For program point L672-2(lines 672 676) no Hoare annotation was computed. [2022-11-02 20:48:39,903 INFO L899 garLoopResultBuilder]: For program point L639-2(lines 638 660) no Hoare annotation was computed. [2022-11-02 20:48:39,903 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-11-02 20:48:39,903 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 342 351) no Hoare annotation was computed. [2022-11-02 20:48:39,903 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-11-02 20:48:39,903 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 604) no Hoare annotation was computed. [2022-11-02 20:48:39,903 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 615) no Hoare annotation was computed. [2022-11-02 20:48:39,904 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 626) no Hoare annotation was computed. [2022-11-02 20:48:39,904 INFO L895 garLoopResultBuilder]: At program point L111-2(lines 111 667) the Hoare annotation is: (let ((.cse24 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse23 (* (div .cse24 4294967296) 4294967296)) (.cse16 (mod .cse24 4294967296))) (let ((.cse17 (not (<= .cse16 2147483647))) (.cse21 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse25 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse23) .cse24))) (let ((.cse5 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse3 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse18 (or (and (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse23 4294967296) .cse24) (not (<= .cse24 (+ 2147483647 .cse23)))) .cse25)) (.cse9 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse10 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse12 (not .cse21)) (.cse11 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse19 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse22 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse26 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (or (< .cse16 8656) .cse17)) (.cse27 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse14 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse2) (and .cse4 .cse2 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse5 .cse6 .cse2) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse12) (and .cse0 .cse13 .cse7 .cse8 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse4 .cse2) (and .cse14 .cse9 .cse8 .cse2 .cse15) (and .cse0 (or (<= .cse16 8496) .cse17)) (and .cse18 .cse4 .cse19 .cse1) (and .cse9 .cse13 .cse20 .cse21 .cse2) (and .cse14 .cse0 .cse22 .cse2) (and .cse4 .cse1 .cse2 .cse3) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse2) (and .cse0 .cse13 .cse20) (and .cse0 .cse13 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) .cse2) (and .cse18 .cse4 .cse19 .cse7 .cse8) (and .cse14 .cse9 .cse12 .cse15) (and .cse9 .cse10 .cse13 .cse12) (and .cse4 (= (+ 8496 .cse23) .cse24) .cse25 .cse8) (and .cse4 .cse19 .cse22 .cse1 .cse2) (and .cse4 .cse13 .cse7 .cse8 .cse2) (and .cse0 .cse12) (and .cse4 .cse26 .cse7 .cse8 .cse2 .cse27) (and .cse14 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse11 .cse8 .cse2) (and .cse4 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (and .cse0 .cse25) (and .cse4 .cse19 .cse22 .cse7 .cse8 .cse2) (and .cse0 .cse26 .cse7 .cse8 .cse2 .cse27) (and .cse14 .cse0 .cse15)))))) [2022-11-02 20:48:39,904 INFO L895 garLoopResultBuilder]: At program point L178(lines 177 615) the Hoare annotation is: (let ((.cse5 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (let ((.cse6 (not (<= .cse5 2147483647))) (.cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse10 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse9 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse12 (not .cse11)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (or (< .cse5 8656) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 (or (<= .cse5 8496) .cse6)) (and .cse4 .cse1 .cse7 .cse8 .cse3) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse9 .cse1 .cse10 .cse11 .cse3) (and .cse4 .cse1 .cse10) (and .cse4 .cse1 .cse12) (and .cse0 .cse1 .cse12) (and .cse9 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1 .cse12) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse8 .cse3))))) [2022-11-02 20:48:39,905 INFO L895 garLoopResultBuilder]: At program point L145(lines 138 628) the Hoare annotation is: (let ((.cse9 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (.cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not .cse5)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse7 (let ((.cse12 (mod .cse9 4294967296))) (or (< .cse12 8656) (not (<= .cse12 2147483647)))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse6 .cse7 .cse8) (and .cse1 (= (+ 8496 (* (div .cse9 4294967296) 4294967296)) .cse9) .cse5 .cse6 .cse8 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse4 .cse10) (and .cse1 .cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3) (and .cse0 .cse2 .cse10 .cse3) (and .cse11 .cse4 .cse7)))) [2022-11-02 20:48:39,905 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-11-02 20:48:39,905 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 645) no Hoare annotation was computed. [2022-11-02 20:48:39,905 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 603) no Hoare annotation was computed. [2022-11-02 20:48:39,905 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 614) no Hoare annotation was computed. [2022-11-02 20:48:39,905 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 625) no Hoare annotation was computed. [2022-11-02 20:48:39,906 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 636) no Hoare annotation was computed. [2022-11-02 20:48:39,906 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2022-11-02 20:48:39,906 INFO L895 garLoopResultBuilder]: At program point L214(lines 210 604) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse0) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (let ((.cse2 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse2 8656) (not (<= .cse2 2147483647)))) .cse0) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0) (and .cse1 .cse3 .cse0) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse0))) [2022-11-02 20:48:39,906 INFO L895 garLoopResultBuilder]: At program point L115(lines 114 636) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-11-02 20:48:39,906 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-11-02 20:48:39,907 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2022-11-02 20:48:39,907 INFO L895 garLoopResultBuilder]: At program point L380(lines 363 398) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-11-02 20:48:39,907 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 436) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-11-02 20:48:39,907 INFO L899 garLoopResultBuilder]: For program point L249(lines 249 254) no Hoare annotation was computed. [2022-11-02 20:48:39,907 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 602) no Hoare annotation was computed. [2022-11-02 20:48:39,908 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 613) no Hoare annotation was computed. [2022-11-02 20:48:39,908 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 624) no Hoare annotation was computed. [2022-11-02 20:48:39,908 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 635) no Hoare annotation was computed. [2022-11-02 20:48:39,908 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 386) no Hoare annotation was computed. [2022-11-02 20:48:39,908 INFO L895 garLoopResultBuilder]: At program point L217(lines 216 602) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-11-02 20:48:39,908 INFO L895 garLoopResultBuilder]: At program point L184(lines 180 614) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse2 .cse3) (and .cse5 .cse4 .cse6 .cse1 .cse7) (and .cse5 .cse6 .cse1 .cse8 .cse7) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse1 .cse8 .cse3))) [2022-11-02 20:48:39,909 INFO L895 garLoopResultBuilder]: At program point L151(lines 147 625) the Hoare annotation is: (let ((.cse11 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (let ((.cse9 (< .cse11 8656)) (.cse10 (not (<= .cse11 2147483647)))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (or .cse9 .cse10)) (.cse4 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse6) (and .cse0 (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2 .cse7 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse4 (or .cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) .cse10) .cse7 .cse6) (and .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse2 .cse7 .cse3))))) [2022-11-02 20:48:39,909 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2022-11-02 20:48:39,909 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 422) no Hoare annotation was computed. [2022-11-02 20:48:39,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:48:39,909 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 592) no Hoare annotation was computed. [2022-11-02 20:48:39,909 INFO L899 garLoopResultBuilder]: For program point L582-1(lines 582 592) no Hoare annotation was computed. [2022-11-02 20:48:39,910 INFO L899 garLoopResultBuilder]: For program point L483(lines 483 487) no Hoare annotation was computed. [2022-11-02 20:48:39,910 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 289) no Hoare annotation was computed. [2022-11-02 20:48:39,910 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 612) no Hoare annotation was computed. [2022-11-02 20:48:39,910 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 623) no Hoare annotation was computed. [2022-11-02 20:48:39,910 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 634) no Hoare annotation was computed. [2022-11-02 20:48:39,910 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 521) no Hoare annotation was computed. [2022-11-02 20:48:39,910 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 327) no Hoare annotation was computed. [2022-11-02 20:48:39,911 INFO L895 garLoopResultBuilder]: At program point L220(lines 219 601) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-11-02 20:48:39,911 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2022-11-02 20:48:39,911 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 85 93) no Hoare annotation was computed. [2022-11-02 20:48:39,911 INFO L902 garLoopResultBuilder]: At program point L683(lines 76 685) the Hoare annotation is: true [2022-11-02 20:48:39,911 INFO L899 garLoopResultBuilder]: For program point L650(lines 650 656) no Hoare annotation was computed. [2022-11-02 20:48:39,911 INFO L899 garLoopResultBuilder]: For program point L551(lines 551 556) no Hoare annotation was computed. [2022-11-02 20:48:39,912 INFO L902 garLoopResultBuilder]: At program point L684(lines 19 686) the Hoare annotation is: true [2022-11-02 20:48:39,912 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-11-02 20:48:39,912 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 611) no Hoare annotation was computed. [2022-11-02 20:48:39,912 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 622) no Hoare annotation was computed. [2022-11-02 20:48:39,912 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 633) no Hoare annotation was computed. [2022-11-02 20:48:39,912 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-11-02 20:48:39,912 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:48:39,913 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 221 598) no Hoare annotation was computed. [2022-11-02 20:48:39,913 INFO L895 garLoopResultBuilder]: At program point L190(lines 186 612) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse9 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (let ((.cse10 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse10 8656) (not (<= .cse10 2147483647)))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse6) (and .cse4 .cse5 .cse1 .cse7 .cse6) (and .cse4 .cse8 .cse5 .cse1 .cse6) (and .cse8 .cse9 .cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse2) (and .cse1 .cse7 .cse3) (and .cse8 .cse9 .cse1 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2))) [2022-11-02 20:48:39,913 INFO L895 garLoopResultBuilder]: At program point L157(lines 153 623) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-11-02 20:48:39,913 INFO L895 garLoopResultBuilder]: At program point L224(lines 117 635) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-11-02 20:48:39,913 INFO L899 garLoopResultBuilder]: For program point L522(lines 522 526) no Hoare annotation was computed. [2022-11-02 20:48:39,914 INFO L899 garLoopResultBuilder]: For program point L522-2(lines 522 526) no Hoare annotation was computed. [2022-11-02 20:48:39,914 INFO L899 garLoopResultBuilder]: For program point L456-1(lines 456 468) no Hoare annotation was computed. [2022-11-02 20:48:39,914 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 610) no Hoare annotation was computed. [2022-11-02 20:48:39,914 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 621) no Hoare annotation was computed. [2022-11-02 20:48:39,914 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 632) no Hoare annotation was computed. [2022-11-02 20:48:39,915 INFO L895 garLoopResultBuilder]: At program point L424(lines 415 435) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse6 .cse4))) [2022-11-02 20:48:39,915 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 362) no Hoare annotation was computed. [2022-11-02 20:48:39,915 INFO L899 garLoopResultBuilder]: For program point L358-2(lines 221 598) no Hoare annotation was computed. [2022-11-02 20:48:39,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:48:39,915 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 103) no Hoare annotation was computed. [2022-11-02 20:48:39,915 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 76 685) no Hoare annotation was computed. [2022-11-02 20:48:39,915 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 464) no Hoare annotation was computed. [2022-11-02 20:48:39,916 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 609) no Hoare annotation was computed. [2022-11-02 20:48:39,916 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 620) no Hoare annotation was computed. [2022-11-02 20:48:39,916 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 631) no Hoare annotation was computed. [2022-11-02 20:48:39,916 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 100) no Hoare annotation was computed. [2022-11-02 20:48:39,916 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 431) no Hoare annotation was computed. [2022-11-02 20:48:39,916 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 233) no Hoare annotation was computed. [2022-11-02 20:48:39,917 INFO L895 garLoopResultBuilder]: At program point L196(lines 192 610) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse6 .cse1 .cse8 .cse7) (and .cse5 .cse4 .cse6 .cse1 .cse7) (and .cse1 .cse8 .cse3))) [2022-11-02 20:48:39,917 INFO L895 garLoopResultBuilder]: At program point L163(lines 159 621) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-11-02 20:48:39,917 INFO L899 garLoopResultBuilder]: For program point L229-2(lines 221 598) no Hoare annotation was computed. [2022-11-02 20:48:39,917 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:48:39,917 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 679) no Hoare annotation was computed. [2022-11-02 20:48:39,917 INFO L899 garLoopResultBuilder]: For program point L561(lines 561 565) no Hoare annotation was computed. [2022-11-02 20:48:39,918 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2022-11-02 20:48:39,918 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 608) no Hoare annotation was computed. [2022-11-02 20:48:39,918 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 619) no Hoare annotation was computed. [2022-11-02 20:48:39,918 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 630) no Hoare annotation was computed. [2022-11-02 20:48:39,918 INFO L895 garLoopResultBuilder]: At program point L562(lines 76 685) the Hoare annotation is: false [2022-11-02 20:48:39,918 INFO L895 garLoopResultBuilder]: At program point L133(lines 129 631) the Hoare annotation is: (let ((.cse6 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse7) (and .cse0 .cse6 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse7))) [2022-11-02 20:48:39,919 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 279) no Hoare annotation was computed. [2022-11-02 20:48:39,922 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:39,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:48:39,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:48:39 BoogieIcfgContainer [2022-11-02 20:48:39,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:48:39,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:48:39,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:48:39,977 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:48:39,978 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:27" (3/4) ... [2022-11-02 20:48:39,980 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:48:39,995 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 20:48:39,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:48:39,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:48:39,997 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:48:40,095 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:48:40,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:48:40,097 INFO L158 Benchmark]: Toolchain (without parser) took 74059.81ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 81.5MB in the beginning and 942.4MB in the end (delta: -860.9MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2022-11-02 20:48:40,099 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:48:40,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.48ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 88.6MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:48:40,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.63ms. Allocated memory is still 117.4MB. Free memory was 88.6MB in the beginning and 85.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:48:40,100 INFO L158 Benchmark]: Boogie Preprocessor took 72.03ms. Allocated memory is still 117.4MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:48:40,100 INFO L158 Benchmark]: RCFGBuilder took 963.93ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 89.9MB in the end (delta: -6.4MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2022-11-02 20:48:40,101 INFO L158 Benchmark]: TraceAbstraction took 72269.45ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 89.3MB in the beginning and 950.8MB in the end (delta: -861.5MB). Peak memory consumption was 716.5MB. Max. memory is 16.1GB. [2022-11-02 20:48:40,101 INFO L158 Benchmark]: Witness Printer took 120.26ms. Allocated memory is still 1.1GB. Free memory was 950.8MB in the beginning and 942.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:48:40,105 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.48ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 88.6MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.63ms. Allocated memory is still 117.4MB. Free memory was 88.6MB in the beginning and 85.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.03ms. Allocated memory is still 117.4MB. Free memory was 85.6MB in the beginning and 83.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 963.93ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 89.9MB in the end (delta: -6.4MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 72269.45ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 89.3MB in the beginning and 950.8MB in the end (delta: -861.5MB). Peak memory consumption was 716.5MB. Max. memory is 16.1GB. * Witness Printer took 120.26ms. Allocated memory is still 1.1GB. Free memory was 950.8MB in the beginning and 942.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 679]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.1s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3607 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3607 mSDsluCounter, 9593 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 716 IncrementalHoareTripleChecker+Unchecked, 4440 mSDsCounter, 717 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4691 IncrementalHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 717 mSolverCounterUnsat, 5153 mSDtfsCounter, 4691 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4504 GetRequests, 4435 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19067occurred in iteration=20, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 8149 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 1191 NumberOfFragments, 4968 HoareAnnotationTreeSize, 29 FomulaSimplifications, 41571 FormulaSimplificationTreeSizeReduction, 19.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 141424 FormulaSimplificationTreeSizeReductionInter, 27.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 7884 NumberOfCodeBlocks, 7884 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 9619 ConstructedInterpolants, 35 QuantifiedInterpolants, 26507 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4229 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 17 PerfectInterpolantSequences, 43543/44409 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && s__state <= 8576) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) && 8656 <= s__state) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8656 <= s__state)) || (((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) && 8656 <= s__state)) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && 8656 <= s__state) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) || (((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8466 <= s__state) && s__state < 8496) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8466 <= s__state) && s__state < 8496) && blastFlag == 0)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && s__state <= 8576) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) || (((blastFlag == 1 && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((8466 <= s__state && s__state < 8496) && blastFlag == 0)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8466 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((((!(8673 == s__state) && 8496 == s__state) && !(s__state == 8672)) && blastFlag == 0) && s__state <= 8576)) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8466 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((!(8673 == s__state) && !(s__state == 8672)) && 8466 <= s__state) && (((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !(s__state <= 8496)) || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && blastFlag == 0) && s__state <= 8576)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((((((((2 == blastFlag && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state))) || ((((2 == blastFlag && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8640 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8640 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((8640 <= s__state && blastFlag == 0) && !(8656 <= s__state))) || (((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || ((((2 == blastFlag && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && 8656 <= s__state) || (((3 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (blastFlag == 1 && 8656 <= s__state)) || ((3 == blastFlag && !(0 == s__hit)) && 8656 <= s__state)) || ((2 == blastFlag && !(0 == s__hit)) && 8656 <= s__state) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((((2 == blastFlag && s__state < 8496) && 0 == s__hit) && s__s3__tmp__next_state___0 < 8496) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((2 == blastFlag && 8496 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && !(8496 <= s__state))) || (s__state < 8496 && blastFlag == 0)) || ((((2 == blastFlag && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit))) || ((blastFlag == 1 && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((blastFlag == 1 && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state)) || (((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8544 == s__state)) || (((blastFlag == 1 && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || (2 == blastFlag && !(0 == s__hit))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((s__state == 8528 && 2 == blastFlag) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((!(8673 == s__state) && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (blastFlag == 1 && ((2 * ag_X + 2 * ag_Y) % 4294967296 <= 8496 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && s__s3__tmp__next_state___0 < 8496)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && blastFlag == 1) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((2 == blastFlag && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state))) || ((2 == blastFlag && s__state == 8512) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || (((blastFlag == 1 && s__state <= 8448) && s__state == 3) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576)) || (((!(8673 == s__state) && 3 == blastFlag) && !(0 == s__hit)) && 8656 <= s__state)) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || (((2 == blastFlag && 8496 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || ((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (blastFlag == 1 && !(0 == s__hit))) || (((((2 == blastFlag && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && 8560 == s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || blastFlag == 0) || (blastFlag == 1 && s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y)) || (((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((!(8673 == s__state) && blastFlag == 1) && 8656 <= s__state) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state))) || (((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((2 == blastFlag && s__state <= 8448) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) || ((blastFlag == 1 && s__state <= 8448) && ((2 * ag_X + 2 * ag_Y) % 4294967296 <= 8496 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (s__state <= 8448 && blastFlag == 0)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || ((blastFlag == 1 && s__state <= 8448) && !(0 == s__hit))) || ((2 == blastFlag && s__state <= 8448) && !(0 == s__hit))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || (((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((blastFlag == 1 && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state)) || (((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8544 == s__state)) || (((blastFlag == 1 && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || (2 == blastFlag && !(0 == s__hit))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((s__state == 8528 && 2 == blastFlag) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((!(8673 == s__state) && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (blastFlag == 1 && ((2 * ag_X + 2 * ag_Y) % 4294967296 <= 8496 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && s__s3__tmp__next_state___0 < 8496)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && blastFlag == 1) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((2 == blastFlag && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state))) || ((2 == blastFlag && s__state == 8512) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || (((blastFlag == 1 && s__state <= 8448) && s__state == 3) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576)) || (((!(8673 == s__state) && 3 == blastFlag) && !(0 == s__hit)) && 8656 <= s__state)) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || (((2 == blastFlag && 8496 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || ((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (blastFlag == 1 && !(0 == s__hit))) || (((((2 == blastFlag && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && 8560 == s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || blastFlag == 0) || (blastFlag == 1 && s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y)) || (((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((!(8673 == s__state) && blastFlag == 1) && 8656 <= s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || ((((2 == blastFlag && 8512 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state)) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:48:40,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0257a489-9874-4f9a-b325-994f6611f903/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE